12752
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 24738
- Proper Divisor Sum (Aliquot Sum)
- 11986
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6368
- Möbius Function
- 0
- Radical
- 1594
- 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
- 125
- 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 5's in all partitions of n.at n=36A024789
- Numbers k such that k^2+k+5 is a palindrome.at n=14A027718
- Number of rooted identity trees with n nodes and 8 leaves.at n=3A055333
- a(n) = |{m : multiplicative order of 7 mod m=n}|.at n=39A059889
- Numbers with ordered partitions that have periods of length 5.at n=31A178572
- Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value n+1.at n=14A211837
- A014486-indices for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the left hand side" construction.at n=9A218777
- Number of n X 3 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=5A223913
- T(n,k)=Number of nXk 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=33A223918
- Number of 6Xn 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=2A223923
- Column 4 of array in A226513.at n=7A226741
- Irregular triangle read by rows: T(n,k) is the number of degree-n permutations without overlaps which furnish k new permutations without overlaps upon the addition of an (n+1)st element, 2 <= k <= 1 + floor(n/2).at n=37A259689
- Limiting reverse row of the array A274196.at n=50A274201
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} 1/(1 - j^k*x^j)^(j^k).at n=42A294585
- Expansion of Product_{k>=1} 1/(1 - k^2*x^k)^(k^2).at n=6A294586
- a(n) = A338268(k^2 + 2*n, k) for sufficiently large k.at n=23A338286
- Numbers k such that k + sum of digits of k is a proper prime power.at n=53A342773
- a(0) = 1; thereafter a(n) = 5*n^2 - 5*n + 2.at n=51A386485