12297
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16400
- Proper Divisor Sum (Aliquot Sum)
- 4103
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8196
- Möbius Function
- 1
- Radical
- 12297
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Fibonacci sequence beginning 1, 32.at n=14A022402
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150787
- Numbers k such that tau(k-1) = (tau(k))^2 = tau(k+1), where tau(k) = A000005(k) (number of divisors of k).at n=42A190266
- Least number having exactly two odd prime factors that differ by 2^n.at n=11A190358
- Number of 4 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=14A229447
- Semiprimes of the form p^2 + pq + q^2, where p, q are consecutive primes.at n=8A243904
- Number of (n+2)X(7+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=19A254906
- Numbers m with the property that its k-th smallest divisor, for all 1 <= k <= tau(m), contains exactly k "1" digits in its binary representation.at n=19A255401
- Semiprimes whose prime factors differ from each other in one bit position only.at n=45A261077
- Numerator of the limiting density of residues attained by the Fibonacci sequence modulo powers of the n-th prime.at n=46A350999
- Numbers k whose ordered binary weights (A000120) of their divisors are the numbers 1 to A000005(k).at n=34A354724
- Number of partitions p of n such that (1/3)*max(p) is a part of p.at n=44A363066
- Triangle read by rows: Trace of the Akiyama-Tanigawa algorithm for powers x^3.at n=30A371764
- Antidiagonal-sums of the absolute value of the array A377046(n,k) = n-th term of k-th differences of nonsquarefree numbers (A013929).at n=14A377048