12073
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 12074
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12072
- Möbius Function
- -1
- Radical
- 12073
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- 1446
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of alkyls Y^{II} C_n H_{2n+2} with n carbon atoms.at n=12A000646
- Numbers k such that the continued fraction for sqrt(k) has period 99.at n=8A020438
- Numerators of continued fraction convergents to sqrt(515).at n=8A041984
- Irregular primes with irregularity index three.at n=18A060975
- Engel expansion for (positive) constant defined in A078756.at n=10A080230
- Class 6+ primes.at n=11A081634
- a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).at n=5A090870
- a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).at n=6A090870
- Numbers k such that (2*k)!/(2*k!)-1 is prime.at n=20A091907
- Number of compositions of n with first part 1 and no equal adjacent parts; this is column 1 of the array in A096568.at n=19A096569
- Numbers k such that 2^k - 13 is prime.at n=14A096818
- Primes p such that q-p = 24, where q is the next prime after p.at n=18A098974
- Smallest of five consecutive primes whose sum of digits is prime.at n=29A106718
- Smallest prime of the set of four consecutive primes whose sum of digits is a set of four distinct primes.at n=26A106817
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=28A109561
- Numbers k such that k and 8*k, taken together, are pandigital.at n=13A114126
- Primes p such that there exist three primes q, r and s with p^3=q^3+r^3+s^3.at n=18A114923
- For any number larger than 2, the primes reached when you start with n and concatenate the sum of its prime factors with its largest prime factor, then repeat the process until you eventually reach a prime, or print a -1 if you never do.at n=26A125674
- For any number larger than 2, the primes reached when you start with n and concatenate the sum of its prime factors with its largest prime factor, then repeat the process until you eventually reach a prime, or print a -1 if you never do.at n=23A125674
- a(n) = smallest number k such that P(k)/P(k+1) > P(k+1)/P(k+2) > ... > P(k+n+1)/P(k+n+2), where P(k) = k-th prime = A000040(k).at n=5A133697