12575
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 3049
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10040
- Möbius Function
- 0
- Radical
- 2515
- Omega Function (Ω)
- 3
- 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
- 156
- 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
- no
- Odd
- yes
Appears in sequences
- Multiplicity of highest weight (or singular) vectors associated with character chi_73 of Monster module.at n=43A034461
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(3,5) = cn(4,5).at n=78A036873
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=36A039893
- Numerators of continued fraction convergents to sqrt(70).at n=8A041122
- Numerators of continued fraction convergents to sqrt(630).at n=2A042208
- Numbers k such that k^10 == 1 (mod 11^4).at n=7A056094
- Smallest m such that A065623(m) = n.at n=35A065624
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=38A166059
- Number of 14X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 14 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=10A192715
- Number of length n+3 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=38A255994
- a(n) is the largest term encountered on the path to 0 when iterating the map x -> x', and starting from x = A351255(n). Here x' means the arithmetic derivative of x, A003415.at n=13A351261
- Result of inserting the integers n = 0, 1, 2, ... in this order into an initially empty list, where n is inserted between the pair of consecutive elements with sum equal to n and minimal absolute difference, or at the end of the list if no such pair exists.at n=35A360447
- a(n) = A068346(A276086(n)), where A068346 is the second arithmetic derivative, and A276086 is the primorial base exp-function.at n=28A370131