15167
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15720
- Proper Divisor Sum (Aliquot Sum)
- 553
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14616
- Möbius Function
- 1
- Radical
- 15167
- 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
- 84
- 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
- a(1)=0; for n>1, a(n) = number of isomeric hydrocarbons of the acetylene series with carbon content n.at n=14A000642
- Numbers having four 2's in base 9.at n=26A043464
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=35A085607
- Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=38A117455
- Numbers m such that greatest prime divisor of (m-th prime + 1) is 3.at n=28A121820
- Read (exponents of primes in the factorization of n!) modulo 2 and convert to decimal.at n=41A240504
- Semiprimes generated by the polynomial 2 * n^2 + 29.at n=16A241554
- Number of polynomials a_k*x^k + ... + a_1*x + a_0 with k > 0, integer coefficients and only non-multiple positive integer roots and a_0 = p^n (p is a prime).at n=39A248956
- Non-palindromic composite numbers such that n' = [Rev(n)]', where n' is the arithmetic derivative of n.at n=9A259077
- Number of partitions of (2, n) into a sum of distinct pairs.at n=34A268345
- Expansion of Product_{k>=1} (1 + x^k)^A001615(k), where A001615 is the Dedekind psi function.at n=16A301594
- a(n) = N^(1/4) * log(N) / sqrt(log(log(N))) rounded to nearest integer, with N=10^n. Related to operation count of the deterministic factorization of an integer N using an improved Pollard-Strassen method.at n=11A309917
- Number of parts in all partitions of 2n with largest multiplicity n.at n=26A320381
- Number of compositions of 2n where the difference between largest and smallest parts equals n.at n=12A323111
- MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).at n=1A326259
- Numbers m such that A338038(m) = A338038(A004086(m)) where A004086(i) is i read backwards and A338038(i) is the sum of the primes and exponents in the prime factorization of i ignoring 1-exponents; palindromes and multiples of 10 are excluded.at n=30A338039
- Composite numbers of the form 2*k^2 + 29.at n=16A352949
- a(n) = (A051894(n) - 1)/2.at n=17A361152
- Consecutive states of the linear congruential pseudo-random number generator 172*s mod 30307 when started at s=1.at n=32A385032