15632
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 30318
- Proper Divisor Sum (Aliquot Sum)
- 14686
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7808
- Möbius Function
- 0
- Radical
- 1954
- Omega Function (Ω)
- 5
- 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
- 102
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sum of n plus its prime factors associated with A020700.at n=23A020905
- Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=29A028644
- Obtainable by applying +, * and exponentiation to its own digits.at n=21A046469
- Lesser of two consecutive numbers each divisible by a fourth power.at n=30A068782
- "Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.at n=30A080035
- a(n) = 2*a(n-1) + 6*a(n-2).at n=8A083098
- a(n) = n^3 + 7.at n=25A084377
- Number of elements in the coprime subsets of the integers 1 to n.at n=20A087080
- a(n) = 6^n * T(n, 4/3) where T is the Chebyshev polynomial of the first kind.at n=4A099142
- Numbers n such that 5*10^n + 6*R_n - 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=18A103017
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=40A111045
- An even-powered type Binet p-adic triangular sequence: t(n,m)=((( 1 + sqrt(prime(n))))^(2*m) + (( 1 - sqrt(prime(n))))^(2*m))/2.at n=9A140896
- Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=7A156954
- Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=9A157198
- A169759(n)/6.at n=7A169760
- Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=32A212683
- Numbers k such that k and k + 1 are both of the form p*q^4 where p and q are distinct primes.at n=4A215197
- Minimal number (in decimal representation) with n nonprime substrings in base-5 representation (substrings with leading zeros are considered to be nonprime).at n=25A217105
- Numbers of the form 5^j + 7^k, for j and k >= 0.at n=31A226818
- a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=43A236395