10402
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 7454
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4452
- Möbius Function
- -1
- Radical
- 10402
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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(0) = 1, a(n) = 26*n^2 + 2 for n>0.at n=20A010016
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=17A023073
- Positive numbers k such that k and 4*k are anagrams in base 8 (written in base 8).at n=8A023075
- a(n) = prime(n)*prime(n-1) - 1.at n=26A023515
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 100.at n=31A031598
- Multiples of 7 whose sum of digits is equal to 7.at n=21A063416
- a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 10.at n=4A086927
- Moebius transform of binomial(n+3, 4).at n=20A117109
- Product of twin primes minus 1.at n=8A120875
- Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(i)-i|)=k (n>=1, 0<=k<=n-1).at n=33A130152
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150633
- Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=28A212683
- Minimum value unattainable as the sum of 6 attained values of i^2 with i in 0..n.at n=44A225279
- a(n) = 9*n^2 + 18*n + 7.at n=33A259055
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=34A294871
- Numbers k such that (13*10^k + 311)/9 is prime.at n=15A295031
- Coordination sequence for "tsi" 3D uniform tiling.at n=40A299289
- Number of nX3 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=17A303309
- Sum of binomial(Y(2,p), 2) over the partitions p of n, where Y(2,p) is the number of part sizes with multiplicity 2 or greater in p.at n=26A304825
- Number of permutations p of [n] such that max_{j=1..n} |p(j)-j| = 5.at n=3A323801