16402
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 8798
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8004
- Möbius Function
- -1
- Radical
- 16402
- 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
- 115
- 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
- MacMahon's solid partitions of n in which 2 is the smallest summand.at n=12A002043
- First occurrence of exactly n identical terms in A007448.at n=18A016046
- Fibonacci sequence beginning 1, 16.at n=16A022106
- Numbers having four 4's in base 9.at n=2A043472
- Numbers m such that 2*phi(m) = phi(m+1).at n=19A050472
- Number of partitions of n where n divides the product of the parts.at n=39A057568
- a(0) = 1; a(n) = (5*3^(n-1) - 1)/2 for n > 0.at n=9A060816
- a(n) = ((2n+1)*3^n - 1)/2.at n=6A079272
- Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.at n=11A079941
- Number of ways associated with A088959.at n=26A088111
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,...(n 1's)...,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], ...at n=15A088209
- a(0)=1; a(n) = sigma_2(n) + sigma_3(n).at n=25A092344
- Sum of the sizes of the tails below the Durfee squares of all partitions of n.at n=24A116365
- Number of permutations of length n that avoid the patterns 132, 4321.at n=22A116701
- 8n+3^n+5^n.at n=6A120948
- a(n) = (1/2)*(n^3 - 6*n^2 + 13*n - 6).at n=33A158498
- Triangle T(n,k) read by rows: T(n,k) = (m*n - m*k + 1)*T(n - 1, k - 1) + k*(m*k - (m - 1))*T(n - 1, k) where m = 2.at n=17A166961
- The maximum integer dimension in which the volume of the hypersphere of radius n remains larger than 1.at n=30A177677
- Expansion of (1+2x-x^3+x^4)/(1-4x^2+3x^4).at n=17A181655
- Joint-rank array of the numbers (3*i+2)*3^j, where i>=0, j>=0, by antidiagonals.at n=46A182950