6150
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 9474
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1600
- Möbius Function
- 0
- Radical
- 1230
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 12 positive 10th powers.at n=6A004812
- Numbers that are the sum of 9 positive 11th powers.at n=3A004820
- Numbers that are the sum of at most 9 positive 11th powers.at n=33A004915
- Numbers that are the sum of at most 10 positive 11th powers.at n=36A004916
- Numbers that are the sum of at most 11 positive 11th powers.at n=39A004917
- Triangle T read by rows: differences of Motzkin triangle (A026300).at n=74A026105
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array defined in A026105.at n=8A026109
- a(n) = T(2n,n-1), T given by A026780.at n=5A026782
- a(n) = greatest number in row n of array T given by A026780.at n=12A027246
- Numbers k such that 165*2^k-1 is prime.at n=46A050834
- Number of nonnegative integer 2 X 2 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.at n=49A054974
- Numbers n such that n | sigma_10(n).at n=42A055714
- Integers formed from the reduced residue sets of even numbers and Fibonacci numbers.at n=9A063683
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.at n=27A064238
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,9.at n=10A064241
- Number of nonequivalent solutions to the order n checkerboard problem up to reflection and rotation: place n pieces on an n X n board so there is exactly one piece in each row, column and main diagonal.at n=8A064280
- Numbers k such that sigma_k(k)/k is an integer, where sigma_k(k) is the sum of the k-th powers of the divisors of k (A023887).at n=42A067313
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=19A070964
- Sum of all digits of all integers less than or equal to 555...55 (with n 5's) in base 10.at n=3A087330
- Numbers n such that n^2+n+41 (Euler's "prime generating polynomial") is not squarefree.at n=38A097823