10013
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 1507
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 10013
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 65
- 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
- n written in base where place values are positive squares.at n=31A007961
- [ (4th elementary symmetric function of P(n))/(2nd elementary symmetric function of P(n)) ], where P(n) = {first n+3 primes}.at n=13A024456
- Values of n where number of permutations of digits a(n) that are prime increases.at n=10A046891
- a(n) is the least number with exactly n permutations of digits that are primes.at n=13A046893
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=37A050934
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=33A051939
- Number of commutative asymmetric semigroups of order n.at n=7A058105
- Numbers n such that sum of digits = number of digits.at n=30A061384
- Numbers k such that 4*phi(k) = 3*sigma(k).at n=2A065819
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=28A075604
- Least 3-brilliant number of size n.at n=4A083128
- Starting term of the smallest n-chain of numbers whose squares are permutations of the same digits.at n=10A085546
- Smallest nontrivial multiple of n whose nonzero digit product is the same as that of the nonzero digit product of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.at n=30A087304
- Smaller of number pair whose squares are reversals of each other, with no leading zeros allowed.at n=31A106323
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=33A108157
- Where records occur in A117831.at n=13A118474
- a(n) is the nearest integer to log(lcm(1,2,3,...,10^n)).at n=4A121161
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)+1 are twin primes with p(h) = h-th prime.at n=27A129310
- Partial sums of A100119. Sum of first n of the n-th centered n-gonal numbers.at n=16A130218
- Alliterative numbers: Positive integers n such that all words in n's name begin with the same letter; ignore numbers with one-word names.at n=43A146755