12469
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12844
- Proper Divisor Sum (Aliquot Sum)
- 375
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12096
- Möbius Function
- 1
- Radical
- 12469
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_80 of Monster module.at n=37A034468
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=7A045307
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=15A049921
- a(n) = floor(Pi^n + e^n).at n=8A061675
- 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, 0), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148804
- Number of triangular nXnXn 0..6 arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=4A195803
- T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=49A195805
- Number of triangular of a 5 X 5 X 5 0..n arrays with all rows and diagonals having the same length having the same sum, with corners zero.at n=5A195806
- a(n) = prime(2^(n+1)) - 2*prime(2^n).at n=13A197072
- Number of partitions p of n that are separable by the 2*min(p); see Comments.at n=52A239516
- Products of any two not necessarily distinct terms of A237424.at n=41A254143
- Remove in decimal representation of A254143(n) all repeated digits.at n=41A254323
- Composite numbers k such that A378056(k) = gcd(lcm{d+1 : d|k}, lcm{d-1 : d > 1 and d|k}) = 2.at n=42A378057