12422
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18636
- Proper Divisor Sum (Aliquot Sum)
- 6214
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6210
- Möbius Function
- 1
- Radical
- 12422
- 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
- 156
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci numbers written in base 5.at n=16A004688
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=40A105282
- 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, -1, 1), (-1, 1, 1), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150817
- a(n) = ((4 + 3*sqrt(2))*(1 + 2*sqrt(2))^n + (4 - 3*sqrt(2))*(1 - 2*sqrt(2))^n)/8.at n=7A164589
- Number of strings of numbers x(i=1..5) in 0..n with sum i*x(i)^2 equal to n*25.at n=35A184444
- Number of n X n symmetric 0..6 arrays with no element equal to any horizontal or vertical neighbor and with new values 0..6 introduced in lower triangular row major order.at n=3A193272
- Numbers n such that n*8^n - 1 is prime.at n=13A242201
- a(n) = (binomial(2n, n) - 2) mod n^3.at n=29A246133
- a(n) = Fibonacci(n) represented in bijective base-5 numeration.at n=15A282236
- Number of noncrossing path sets on n nodes with each path having a prime number of nodes.at n=10A303729
- G.f. A(x) satisfies: 1 + 2 * Sum_{n>=1} A(x)^(n*(n+1)/2) * x^n = Sum_{n>=0} (1 + x*A(x)^n)^n * x^n.at n=5A326089
- Least k such that A000790(k) = A108574(n).at n=35A326610
- Expansion of g.f. (1 + x) * (1 + x^2) * Product_{k>=1} (1 + x^k).at n=50A329289
- Indices where the cumulative sum of sin(2k+1)^(2k+1) reaches a record high value.at n=19A387706