12029
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12576
- Proper Divisor Sum (Aliquot Sum)
- 547
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11484
- Möbius Function
- 1
- Radical
- 12029
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=37A020415
- Numerators of continued fraction convergents to sqrt(521).at n=7A041996
- Denominators of continued fraction convergents to sqrt(879).at n=10A042699
- Numbers k such that k^18 == 1 (mod 19^3).at n=30A056089
- Sum of squares of five consecutive primes.at n=12A131686
- Sum of all primes from n-th prime to (2*n-1)-th prime.at n=40A161463
- a(n) = a(n-2)*2 + floor(sqrt(a(n-1))).at n=25A182559
- a(n) = (11*3^n+1)/2.at n=7A199113
- n for which A079277(n) + phi(n) < n.at n=14A208815
- Square array A by downward antidiagonals: A(n,k) = (3 + 3^n*(2*floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=62A254051
- Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = S(4*A257499(n,k) - 3), n,k >= 1, where the function S is as defined in A257480.at n=37A254067
- Square array A(row,col) = A000265(A254051(row,col)).at n=62A254101
- Irregular triangle read by rows: Numbers of unbranched k-5-catafusenes.at n=53A323944
- Numbers k such that k![4] - 16 is prime, where k![4] = A007662(k) = quadruple factorial.at n=30A329166
- a(n)^2 is the end of the first occurrence of n consecutive perfect powers, all of which are squares with exponents equal to 2 (A111245).at n=34A340664
- G.f. A(x) = Sum_{n>=0} a(n)*x^n where a(n) = Sum_{k=0..n-1} 2^(n-k-1) * ( ([x^k] A(x)^n) (mod 2^n) ) for n > 0, with a(0) = 1.at n=9A376232