10059
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 5301
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5736
- Möbius Function
- -1
- Radical
- 10059
- 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
- 135
- 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
- no
- Odd
- yes
Appears in sequences
- Number of binary vectors of length n+1 beginning with 0 and containing just 1 singleton.at n=18A006367
- Number of 5-tuples of different integers from [ 1,n ] with no common factors among quadruples.at n=18A015644
- Numbers k such that 221*2^k+1 is prime.at n=30A032487
- Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5).at n=35A039837
- Lexicographically earliest sequence of positive integers with the property that a(a(n)) = a(1)+a(2)+...+a(n).at n=24A105753
- Numbers k for which 14*k+1, 14*k+5, 14*k+11 and 14*k+13 are primes.at n=34A123987
- Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring.at n=17A137741
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z.at n=29A212068
- Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i*j*k| <= n and gcd(i,j,k) <= 1.at n=32A226357
- Regular triangle where T(n,k) is the number of multiset partitions of strongly normal multisets of size n into k blocks, where a multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities.at n=41A317449
- Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=16A323750
- a(n) is the number of nonnegative integers that can be represented in a 7-segment display by using only n segments (version A063720).at n=19A343314
- Triangle read by rows. T(n,k) is the number of labeled threshold graphs on n vertices with k components, for 1 <= k <= n.at n=22A348436
- Number of integer partitions of n whose distinct parts have integer median.at n=34A360686
- A list of lists where T(n,k) is the smallest n-digit number whose digits have arithmetic mean k, for 1 <= k <= 9.at n=38A362038
- Expansion of 1 / Sum_{k in Z} x^(2*k) / (1 - x^(5*k+2)).at n=46A375061
- Expansion of e.g.f. (1/x) * Series_Reversion( x * exp(-sin(x)) ).at n=6A381145
- Consecutive states of the linear congruential pseudo-random number generator 259*s mod 2^15 when started at s=1.at n=23A384194