12205
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14652
- Proper Divisor Sum (Aliquot Sum)
- 2447
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9760
- Möbius Function
- 1
- Radical
- 12205
- 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
- no
- Odd
- yes
Appears in sequences
- Base-7 Armstrong or narcissistic numbers, written in base 7.at n=14A010349
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=31A038693
- Numbers n such that phi(n-1) + phi(n+1) = phi(2n).at n=10A067701
- a(n) = (1/2)*(Bell(n+2)+Bell(n+1)-Bell(n)).at n=7A087648
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=17A097155
- Table T(n,k) = sum over all set partitions of n of number at index k.at n=35A120057
- 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, 0), (-1, 1, 0), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149225
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=19A152207
- Consider positive integer solutions to x^3 + y^3 = z^3 - n or 'Fermat near misses' of 1, 2, 3 ... Arrange known solutions by increasing values of n. Sequence gives value of lowest z for a given n.at n=27A173515
- Successive records in maximal positive distance d = x^3 - y^2.at n=44A198831
- Number of partitions of n^2 into distinct squares > 1.at n=44A298642
- G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=14A307604
- Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of five and m runs through the set of least numbers whose prime signature is a partition of n.at n=8A309920
- Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of eight and m runs through the set of least numbers whose prime signature is a partition of n.at n=5A309923
- Array read by upwards antidiagonals: T(m,n) = number of set partitions into distinct parts of the multiset consisting of one copy each of x_1, x_2, ..., x_m, and two copies each of y_1, y_2, ..., y_n, for m >= 0, n >= 0.at n=37A322770
- Number A(n,k) of partitions of the (n+k)-multiset {1,2,...,n,1,2,...,k} into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=46A346517
- Number A(n,k) of partitions of the (n+k)-multiset {1,2,...,n,1,2,...,k} into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=53A346517
- Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=47A346520
- Number of partitions of the (n+7)-multiset {0,...,0,1,2,...,7} with n 0's into distinct multisets.at n=2A346827
- Number of partitions of the (n+8)-multiset {1,2,...,n,1,2,...,8} into distinct multisets.at n=1A346901