9013
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9014
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9012
- Möbius Function
- -1
- Radical
- 9013
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1121
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes such that in p^2 the parity of digits alternates.at n=40A030145
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=34A031818
- Lower prime of a pair of consecutive primes having a difference of 16.at n=29A031934
- Numbers whose set of base-13 digits is {1,4}.at n=25A032825
- Number of binary codes of length 5 with n words.at n=9A034190
- Number of binary codes of length 5 with n words.at n=23A034190
- Number of binary codes (not necessarily linear) of length n with 9 words.at n=4A034204
- Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=45A039754
- Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=59A039754
- Primes with first digit 9.at n=18A045715
- n plus a googol is prime.at n=24A049014
- Least prime in A031934 (lesser of 16-twins) whose distance to the next 16-twin is 6*n.at n=35A052357
- Primes from products of split even-digit primes.at n=44A053008
- Primes p such that p^11 reversed is also prime.at n=37A059704
- Number of distinct (non-overlapping) twin Harshad numbers whose sum is prime and where the 2nd Harshad is <= 10^n.at n=6A060289
- Numbers k such that 65^k - 64^k is prime.at n=2A062631
- a(1) = 2; a(n+1) is the smallest prime > a(n) which differs from it in every digit.at n=30A068853
- Trisection of A007294.at n=33A073472
- Primes for which the four closest primes are smaller.at n=17A075030
- Beginning with 3, least prime, greater than the previous term, such that the arithmetic mean of first n terms is a prime.at n=26A090918