12488
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 14392
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5328
- Möbius Function
- 0
- Radical
- 3122
- Omega Function (Ω)
- 5
- 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
- 63
- 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
- Fibonacci sequence beginning 4, 18.at n=15A022384
- Decimal part of cube root of a(n) starts with 2: first term of runs.at n=22A034128
- Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=32A054573
- Number of partitions of the n-th prime into parts that are all primes.at n=22A056768
- Consider the line segment in R^n from the origin to the point v=(2,3,5,7,11,...) with prime coordinates; let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.at n=15A059804
- f-amicable numbers where f(n) = n-1.at n=6A066511
- Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives x of each pair.at n=23A070152
- Numbers n with digits in nondecreasing order such that sum of the reciprocal of digits is an integer.at n=25A091784
- Self-convolution 7th power equals A113667, where a(n) = n*A113667(n-1) for n>=1, with a(0)=1.at n=4A113673
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-110 pattern in any orientation.at n=20A146269
- a(n) = 16*n^2 - 2*n.at n=27A158058
- a(n) is the concatenation, in ascending order, of the set of digits 1,2,4,8 whose sum equals the n-th prime using a minimal number of digits.at n=8A166745
- n - (sum of prime factors of n^2+1) is a positive square.at n=35A216896
- Number of Sidon subsets of {1,...,n} of size 4.at n=26A241688
- Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.at n=51A244081
- G.f. satisfies: A(x) = Series_Reversion( x - A'(x)*A(x)^2 ).at n=5A259606
- Numbers n such that Bernoulli number B_{n} has denominator 870.at n=38A272185
- Expansion of 1/(1 - Sum_{p prime, k>=2} x^(p^k)).at n=62A280605
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=34A320719
- Number of integer partitions of n with a unique composite part.at n=43A379302