16452
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 41678
- Proper Divisor Sum (Aliquot Sum)
- 25226
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5472
- Möbius Function
- 0
- Radical
- 2742
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Sums of 3 distinct powers of 4.at n=39A038471
- Base-8 palindromes that start with 4.at n=19A043024
- Indices of primes in sequence defined by A(0) = 97, A(n) = 10*A(n-1) - 63 for n > 0.at n=21A100998
- Integers k such that 10^k + 31 is prime.at n=12A107083
- A106486-encodings of combinatorial games with value 2.at n=20A125995
- Averages of twin primes of the form : i^2+j^2, as sum of two squares.at n=29A143793
- Averages of twin prime pairs which are a sum of averages of two consecutive twin prime pairs.at n=30A160916
- Record differences for n^2 - phi(n)*sigma(n).at n=30A164876
- G.f.: A(x) = exp( Sum_{n>=1} A179307(n)*x^n/n ), where A179307(n) = Sum_{d|n} C(n,d)*sigma(d)*sigma(n/d).at n=11A179306
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2>=x*y*z.at n=18A212064
- Shiraishi numbers: a parametrized family of solutions c to the Diophantine equation a^3 + b^3 + c^3 = d^3 with d = c+1.at n=23A226903
- Number of 4Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=7A301887
- Number of maximal subsets of {1..n} containing n such that every subset has a different sum.at n=35A325867
- a(n) = Sum_{d|n} n^sigma(d).at n=3A345895
- If the binary expansion of A354780(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=19A354781
- If the binary expansion of A354757(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=40A354783
- Numbers k for which k' = x'*y', where k = x + y with x and y composite, and k', x', y' are the arithmetic derivatives of k, x, y.at n=52A370126