10250
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19656
- Proper Divisor Sum (Aliquot Sum)
- 9406
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 0
- Radical
- 410
- Omega Function (Ω)
- 5
- 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
- 55
- 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
- Number of graphs with n nodes and n edges.at n=11A001434
- Numbers k such that sigma(k+2) = sigma(k).at n=19A007373
- Positive integers n such that n | (2^n + n/2 + 1).at n=9A015945
- Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=19A023079
- Unitary superperfect numbers: numbers n such that usigma(usigma(n)) = 2*n, where usigma(n) is the sum of unitary divisors of n (A034448).at n=6A038843
- Denominators of continued fraction convergents to sqrt(472).at n=12A041901
- Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=10A045056
- Numbers k that divide 4^k + 2^k or 8^k + 4^k.at n=39A045577
- Number of pairs of twin primes whose smaller element is <= 10^n-th prime.at n=4A049035
- Row sums of array T as in A055215.at n=29A054405
- Number of orbits of length n under a map whose periodic points are counted by A056045.at n=19A060173
- Number of divisors of n equals the average of distinct prime factors of n.at n=35A067547
- a(n) = n*(2^n + 1).at n=10A069229
- Smallest k such that gcd(c(k),k) = gcd(A002808(k),k) = A064814(k) = n.at n=49A073257
- Number of pairs of twin primes <= 10^n-th prime.at n=4A093683
- Number of odious primes (A027697) in range ]2^n,2^(n+1)].at n=17A095005
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=17A097225
- A106486-encodings of combinatorial games with value -1.at n=25A125993
- G.f.: A(x) = 1 + x*(1 + x*(1 + x*(...(1 + x*(...)^(2n))...)^6)^4)^2.at n=6A138212
- G.f. A(x) satisfies A(x) = 1 + x*A(x)^3*A(-x).at n=8A143338