12125
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15288
- Proper Divisor Sum (Aliquot Sum)
- 3163
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9600
- Möbius Function
- 0
- Radical
- 485
- Omega Function (Ω)
- 4
- 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
- 143
- 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
- Expansion of e.g.f. exp(7*x)/(1-7*x)^(1/7).at n=4A094911
- Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k).at n=9A096927
- 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=22A097225
- French self-ranked numbers.at n=48A108987
- In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=28A130515
- In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=28A130516
- Number of prime parts in the last section of the set of partitions of n.at n=34A144120
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0100-0100-1111-0010 pattern in any orientation.at n=14A147033
- Square array, read by antidiagonals, used to recursively calculate the Springer numbers A001586.at n=30A185418
- Number of nondecreasing sequences of 3 1..n integers with no element dividing the sequence sum.at n=44A212870
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=38A214453
- Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=24A224134
- Number of partitions of n such that m(1) > m(3), where m = multiplicity.at n=36A240059
- Positive integers m such that pi(m^2) = pi(j^2) + pi(k^2) for no 0 < j <= k < m.at n=44A262408
- Square roots of highly composite numbers, floored down: a(n) = A000196(A002182(n)).at n=58A263096
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1.at n=5A269636
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1.at n=41A269640
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1.at n=3A269643
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=6A273141
- Expansion of e.g.f. arcsin(x*tan(x/2)) (even powers only).at n=5A296941