10503
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15600
- Proper Divisor Sum (Aliquot Sum)
- 5097
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6984
- Möbius Function
- 0
- Radical
- 1167
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- no
- Odd
- yes
Appears in sequences
- a(n)^2 has last digit equal to the sum of the other digits.at n=17A030134
- Number of inequivalent indecomposable binary linear [n,k] codes with no column of zeros of any dimension k <= n.at n=11A076836
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=12A096024
- Numbers k for which digitsum(k) + digitsum(k^2) + digitsum(k^3) = digitsum(k^4).at n=23A118470
- Integer part of Gauss's Arithmetic-Geometric Mean M(1,n^3).at n=43A127759
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k primitive Dyck factors (n >= 0; 0 <= k <= n).at n=58A129154
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 5 and 9.at n=10A136846
- a(n) = n^3 mod (n-th prime squared).at n=27A167623
- First of two consecutive numbers with at least one 3 in their prime signature.at n=51A176313
- Position of 2^n in A051037 (5-smooth numbers).at n=59A188425
- Number T(n,k) of solid standard Young tableaux of n cells and height >= k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=39A215120
- Numbers whose arithmetic derivatives are a permutation of their digits.at n=17A225902
- Number of (n+1)X(1+1) 0..2 arrays with every element both >= and <= some horizontal, vertical, diagonal or antidiagonal neighbor.at n=3A232345
- Number of (n+1)X(4+1) 0..2 arrays with every element both >= and <= some horizontal, vertical, diagonal or antidiagonal neighbor.at n=0A232348
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element both >= and <= some horizontal, vertical, diagonal or antidiagonal neighbor.at n=6A232352
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element both >= and <= some horizontal, vertical, diagonal or antidiagonal neighbor.at n=9A232352
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=29A272421
- G.f. A(x) satisfies: A(x) = (1 + x) * A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=15A307605
- Sum of the third largest parts of the partitions of n into 8 squarefree parts.at n=49A326450
- Admirable totient numbers: numbers that are equal to the sum of their iterated phi, with one of them taken with a minus sign.at n=37A335121