12269
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12270
- 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
- 12268
- Möbius Function
- -1
- Radical
- 12269
- 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
- 63
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1467
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 16.at n=8A031604
- Multiplicity of highest weight (or singular) vectors associated with character chi_34 of Monster module.at n=42A034422
- Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.at n=5A052377
- a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2.at n=8A055011
- a(1) = 2; for n > 1, a(n) = largest prime not exceeding a(1) + ... + a(n-1).at n=14A068524
- Lexicographically earliest infinite sequence of distinct positive numbers with the property that every positive integer is a sum of distinct terms (see algorithm below).at n=14A075058
- Zeros in Cald's sequence: positions k such that A006509(k) = 0.at n=10A112877
- Sum of previous term and preceding non-divisors.at n=14A120610
- Primes of the form 2*3*5*7*k+89, k >= 0.at n=26A141866
- Primes congruent to 22 mod 37.at n=40A142131
- Primes congruent to 10 mod 41.at n=32A142207
- Primes congruent to 14 mod 43.at n=33A142263
- Primes congruent to 2 mod 47.at n=27A142355
- Primes congruent to 19 mod 49.at n=34A142430
- Primes congruent to 26 mod 53.at n=25A142556
- Primes congruent to 4 mod 55.at n=41A142604
- Primes congruent to 14 mod 57.at n=40A142674
- Primes congruent to 56 mod 59.at n=27A142783
- Primes congruent to 8 mod 61.at n=25A142806
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 7: primes in A146332.at n=24A146352