10148
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 8332
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4872
- Möbius Function
- 0
- Radical
- 5074
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- a(n) = n*(11*n - 1)/2.at n=43A022268
- Numbers k such that 217*2^k+1 is prime.at n=5A032485
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=40A035555
- Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=35A035974
- Numbers k such that k + the reversal of k is a square.at n=31A061230
- Integer part of log(n^n)^(1 + log(log(1 + n))).at n=22A062479
- prime(2n) + prime(n) == 0 (mod n).at n=19A066896
- Array, by antidiagonals, arising in asymptotic approximation to the number of p-groups of order p^n.at n=24A152253
- G.f. satisfies: x = A(x - A^2(x - A^3(x - A^4(x - A^5(x -...))))).at n=6A228883
- Number of (n+1)X(n+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 0101 or 1111.at n=2A259516
- Number of (n+1)X(3+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 0101 or 1111.at n=2A259519
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 0101 or 1111.at n=12A259524
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 902", based on the 5-celled von Neumann neighborhood.at n=35A273760
- a(n) = 2*a(n-1) - a(n-2) + a(n-4) for n>3, a(0)=0, a(1)=a(2)=2, a(3)=3.at n=20A286350
- Expansion of 1/(theta_3(q) * theta_3(q^2)), where theta_3() is the Jacobi theta function.at n=24A320069
- Numbers that are the sum of nine fourth powers in eight or more ways.at n=23A345592
- Numbers that are the sum of nine fourth powers in exactly eight ways.at n=20A345850
- Numbers that give a perfect power when added to their reverse.at n=38A366080
- Upper (3/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=9A387781
- Upper (1/2)-midsequence of F(n) and F(n+4), where F = A000045 (Fibonacci numbers); see Comments.at n=18A390351