10068
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 13452
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3352
- Möbius Function
- 0
- Radical
- 5034
- Omega Function (Ω)
- 4
- 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
- 42
- 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
- Theta series of 6-dimensional 8-modular lattice of minimal norm 4.at n=44A029713
- Numbers k such that 47*2^k-1 is prime.at n=10A050549
- Number of nonprimes <= prime(n)^2.at n=27A053683
- Interprimes which are of the form s*prime, s=12.at n=26A075287
- Numbers k with property that k is a peak value in 3x+1 trajectory such that both k+1 and k-1 are prime numbers.at n=41A095385
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=10A096973
- Indices of primes in sequence defined by A(0) = 23, A(n) = 10*A(n-1) + 43 for n > 0.at n=8A101967
- Divisors of 453060.at n=32A134950
- a(n) = 839*n.at n=12A135639
- Let f(z) = z^2 + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c.at n=51A137560
- 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, 0, 1), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=8A149447
- Least number k such that sigma_n(k) > sigma_n(k+1), where sigma_n(k) = sum of the n-th powers of the divisors of k.at n=10A158661
- Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set.at n=49A202019
- Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p).at n=41A241638
- Numbers n with property that A062234(n) = A062234(n+1) = A062234(n+2) = A062234(n+3).at n=8A257892
- Numbers m with m-1, m+1 and prime(m)+2 all prime.at n=24A259539
- The number of overpartitions of n with restricted odd differences.at n=28A260890
- Numbers k such that 3*10^k + 89 is prime.at n=20A276642
- Triangle read by rows: T(n,k) (3 <= k < n) gives number of solutions to certain 1-loop scattering equations refined by MHV degree.at n=22A294735
- Triangle read by rows: T(n,k) (3 <= k < n) gives number of solutions to certain 1-loop scattering equations refined by MHV degree.at n=26A294735