12291
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17424
- Proper Divisor Sum (Aliquot Sum)
- 5133
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7680
- Möbius Function
- -1
- Radical
- 12291
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers that are the sum of 9 positive 11th powers.at n=6A004820
- Numbers k such that k^2 is palindromic in base 8.at n=38A029805
- In A015922, not in A033553.at n=25A033554
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5).at n=34A039904
- Base-4 palindromes that start with 3.at n=42A043005
- Base 8 palindromes that start with 3.at n=18A043023
- CONTINUANT transform of 0, 1, 1, 2, 1, 3, 2, 3, ... (A002487).at n=11A052133
- New record highs reached in A060000.at n=15A060013
- a(n)=2*(4^n-1)/denominator(B(2n)) where B(k) denotes the k-th Bernoulli number.at n=12A090648
- Base 10 numbers that are palindromic in bases 2 and 4.at n=37A097856
- Numbers k such that 13*k = A048720(29,k), where A048720 is carryless base-2 multiplication.at n=35A115805
- Integers i such that 10*i XOR 11*i = 21*i.at n=39A115829
- Number of Fibonacci binary words of length n having no 0110 subword. A Fibonacci binary word is a binary word having no 00 subword.at n=22A130137
- a(n) is the number whose binary representation is A138144(n).at n=13A147595
- Products of 3 distinct primes whose binary expansion is palindromic.at n=42A168355
- a(n) = 2*(4^n - 1) / A027760(n).at n=11A181904
- Subgroups of nimber addition interpreted as binary numbers.at n=37A190939
- Numbers n palindromic in exactly three bases b, 2 <= b <= 10.at n=40A214425
- Numbers k such that 2*k!! - 1 is prime.at n=36A215779
- Numbers whose binary representation is palindromic and in which all runs of 0's and 1's have length at least 2.at n=40A222813