16394
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28128
- Proper Divisor Sum (Aliquot Sum)
- 11734
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7020
- Möbius Function
- -1
- Radical
- 16394
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Low temperature antiferromagnetic susceptibility for diamond.at n=10A007216
- Smallest k>2^n such that 2^k == 2^n (mod k).at n=13A015938
- Coordination sequence for root lattice B_7.at n=3A022149
- Denominators of continued fraction convergents to sqrt(949).at n=10A042837
- McKay-Thompson series of class 39B for Monster.at n=48A058660
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=10A061662
- a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=42A085688
- A sequence generated from a 4th degree Pascal's Triangle polynomial.at n=13A095265
- Square array A(n,k) read by antidiagonals: coordination sequence for lattice B_n.at n=39A103883
- Square array, read by antidiagonals, where row n equals the coordination sequence of B_n lattice, for n >= 0.at n=58A108998
- a(n) = smallest multiple of n which is >= 2^n.at n=13A128093
- Row sums of triangle A132737.at n=13A132738
- a(n) = Sum_{k<=n} A007955(k) * A007955(k) = Sum_{k<=n} A007955(k)^2, where A007955(m) = product of divisors of m.at n=10A174939
- 1/4 the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=26A209725
- Numbers k that divide 2^k + 10.at n=9A245594
- a(n) = 2^n + 10.at n=14A246139
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 310", based on the 5-celled von Neumann neighborhood.at n=34A271198
- Number of pairs (lambda,mu) of partitions lambda of n and mu of five with mu <= lambda (by diagram containment).at n=21A303855
- a(n) = Sum_{d|n} phi(d)^(d-1).at n=7A342489
- a(n) is the smallest number that is the sum of n positive 6th powers in two ways.at n=11A343079