12015
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 9585
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- 0
- Radical
- 1335
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- Numerators of continued fraction convergents to sqrt(954).at n=6A042846
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=6A045152
- Numbers k such that k*k! + 1 is prime.at n=20A090703
- Unsigned row sums of triangle A118407.at n=26A118409
- Number of rectangles in a pyramid built with squares. The squares counted in A092498 are excluded.at n=15A134507
- a(n)=a(n-1)+a(n-2)+a(n-3)+2a(n-4); a(0)=0,a(1)=1,a(2)=3,a(3)=7.at n=14A139814
- 9 times pentagonal numbers: 9*n*(3*n-1)/2.at n=30A152996
- Augmentation of the Fibonacci triangle A058071. See Comments.at n=27A193595
- Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207714
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=31A207717
- Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207719
- Deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m.at n=21A212608
- Braille natural numbers (including zero), using "0" as digit concatenation mark.at n=25A220090
- Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=18A225466
- E.g.f.: Sum_{n>=0} ( -log(1 - n*x)/n )^n / n!.at n=6A232549
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right.at n=29A234691
- Numbers k such that A084937(3k) > A084937(3k+1).at n=30A249689
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 334", based on the 5-celled von Neumann neighborhood.at n=34A271283
- a(n) = 192*2^n - 273 (n>=1).at n=5A304516
- a(n) = A080069(n) OR A267357(n).at n=7A328111