10256
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
- 10
- Divisor Sum
- 19902
- Proper Divisor Sum (Aliquot Sum)
- 9646
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5120
- Möbius Function
- 0
- Radical
- 1282
- Omega Function (Ω)
- 5
- 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
- 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
- Numbers that are the sum of 2 positive 4th powers.at n=46A003336
- Self-convolution of composite numbers.at n=25A023648
- a(n) = T(2n-1,n-2), T given by A026536.at n=7A026546
- Numbers with exactly five distinct base-10 digits.at n=14A031987
- Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).at n=11A036888
- Numbers k that divide 8^k + 2^k.at n=28A045581
- a(n) = A061086(n) / n.at n=15A061087
- a(3) = 2, a(4) = 3; for n > 4, a(n) = {a(n-2)}+{a(n-1)}, where {a} means largest prime <= a.at n=19A065435
- Interprimes which are of the form s*prime, s=16.at n=12A075291
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=41A079024
- Numbers that can be represented as j^4 + k^4, with 0 < j < k, in exactly one way.at n=38A088687
- Numbers n with following property: suppose n^6 = d1 d2 d3 ...dk in decimal; then d1! + d2! + ... + dk! is a square.at n=5A130688
- a(n) = 512n + 16.at n=19A157475
- E.g.f. satisfies: A(x) = 1/(cos(x*A(x)) - sin(x*A(x))).at n=5A201923
- Numbers equal to the Euler totient function of their arithmetic derivative: k = phi(k').at n=40A217715
- Number of partitions p of n such that the number of distinct parts is a part and max(p) - min(p) is a part.at n=46A241387
- Expansion of ((x-1/2)*(1/sqrt(8*x^2-8*x+1)+1)-x)/(x-1).at n=6A261266
- Number of set partitions C_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks; triangle C_t(n), t>=0, 0<=n<=t, read by rows.at n=33A261275
- T(n, m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact differential time dependence.at n=22A274076
- Longest word T from 2 equal length strings S using no breakpoint reuse.at n=19A280430