13034
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24000
- Proper Divisor Sum (Aliquot Sum)
- 10966
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5292
- Möbius Function
- 0
- Radical
- 266
- 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
- 45
- 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
- Number of n-step spirals on hexagonal lattice.at n=12A006776
- Numbers k such that k | 12^k + 11^k + 1.at n=31A057293
- EULER transform of A002620 (with the initial 0,0,1 omitted).at n=11A072338
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=39A072607
- Triangle read by rows: Stirling2 triangle with scaled diagonals (powers of 7).at n=33A075502
- Sixth column of triangle A075502.at n=2A075925
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=41A076531
- Integers that are Rhonda numbers to base 12.at n=11A100971
- a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/5).at n=46A120172
- a(n) = 7*a(n-1) + 56*a(n-2) for n>=3, a(0)=1, a(1)=7, a(2)=98.at n=4A133679
- a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=41A139485
- a(n) = 9*n^2 + n.at n=37A154517
- a(n) = 36*n^2 + 2*n.at n=18A158064
- a(n) = 1444*n^2 + 38.at n=3A158766
- 1/4 the number of arrangements of n+1 nonzero numbers x(i) in -7..7 with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=3A189949
- T(n,k)=1/4 the number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=48A189951
- 1/4 the number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=6A189954
- Numbers k such that k and k+1 both have 16 divisors.at n=30A274359
- Least k for the inner Theodorus spiral to complete n revolutions.at n=35A295339
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=39A295865