10490
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
- 8
- Divisor Sum
- 18900
- Proper Divisor Sum (Aliquot Sum)
- 8410
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4192
- Möbius Function
- -1
- Radical
- 10490
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 104
- 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
- Coordination sequence for root lattice B_3.at n=23A022145
- Numbers k in which the digits of k^2 appear.at n=14A029774
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057040(n)=i(F(n)), where F(n) is the n-th Fibonacci number.at n=39A057040
- Number of paths along a corridor width 8, starting from one side.at n=16A061551
- Numbers k such that k and k^2 have square decimal digits.at n=7A077439
- Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.at n=9A088871
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.at n=10A093059
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 4, s(2n) = 4.at n=8A094854
- Number of compositions of n in which the smallest part is equal to the number of parts.at n=44A098133
- Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) + 27 for n > 0.at n=18A101542
- Numbers n such that sigma(n)=2n-phi(phi(n)).at n=12A110073
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 4 and 9.at n=12A136841
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 5 and 9.at n=9A136858
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=25A136862
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=29A136865
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 8 and 9.at n=35A136867
- a(n) = 250*n - 10.at n=41A154378
- n^2 + {1,3,7} are primes.at n=29A182238
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p={p_1, p_2, p_3, p_4} = {-3,0,1,2}, n=3*r+p_i, and define a(-3)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,4,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=50A187498
- Number of length 5 nonnegative integer arrays starting and ending with 0 with adjacent elements unequal but differing by no more than n.at n=19A205342