16739
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 901
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15840
- Möbius Function
- 1
- Radical
- 16739
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=34A038693
- a(n) = Sum_{i=1..n} i^(i+1).at n=4A062815
- Concatenation of n-th prime and n in decimal notation.at n=38A075110
- a(n) = (a(n-1)*a(n-2) + a(n-2)*a(n-3) + 1)/a(n-4).at n=9A077458
- a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n).at n=33A096461
- Integers of alternate form x+(x+1)^2+(x+2)^3+(x+3)^4+(x+4)^5+(x+5)^6.at n=6A179465
- Maximum value of the cyclic convolution of the first n positive integers with themselves.at n=37A294172
- a(n) = Sum_{k=1..n} k^2 * floor(n/k)^3.at n=17A350124
- Smallest number k with A355915(k) = n.at n=31A356792
- Numbers k such that the sums (with multiplicity) of prime factors of k and k+1 are both squares.at n=20A359445
- Triangle read by rows: row n consists of the n numbers k such that A075254(k) = A346378(n).at n=50A360637