16448
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
- 5
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 32766
- Proper Divisor Sum (Aliquot Sum)
- 16318
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8192
- Möbius Function
- 0
- Radical
- 514
- Omega Function (Ω)
- 7
- 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
- 128
- 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
- a(n) = (2^n + 2^[ n/2 ] )/2.at n=13A001445
- Number of compositions (ordered partitions) of n into powers of 2.at n=18A023359
- Number of points of l_1 norm n in the "diamond" lattice D^+_4.at n=16A035878
- Sums of 2 distinct powers of 4.at n=24A038470
- Numbers k that divide 10^k + 6^k.at n=21A045603
- T(n,4), array T as in A054126.at n=7A054130
- Sums of two powers of 4.at n=31A055236
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 254 = c are special multiples of 257, x = 257k, where largest prime factors of factor k were observed from {2, 3, 5, 17}. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070814 for 14, A070816 for 65534.at n=21A070815
- Numbers n such that phi(n) = b(n,1)^b(n,0) where b(n,1) is the number of 1's in binary representation of n and b(n,0) the number of 0's.at n=44A071638
- Expansion of 1/((1-4*x)*(1-x^4)).at n=7A083589
- a(n) = 4*n^3 + 4*n.at n=16A105374
- Number of points in the standard root system version of the D_4 lattice having L_infinity norm n.at n=8A117216
- a(n) = 2*a(n-1) - 2*(n-2)*a(n-2), with a(0)=1, a(1)=2.at n=11A122033
- a(n) = 16*n^2 + 2*n.at n=31A158056
- a(n) = 2^(2n) + 2^(n-1).at n=6A164051
- a(n) = n^7*(n^8 + 1)/2.at n=2A168665
- Numbers of the form prime(n)*(prime(n)-1)/4.at n=24A171555
- a(n) = ((2^n+1)^n - (2^n-1)^n)/2.at n=3A172340
- Numbers of the form 4^j + 8^k, for j and k >= 0.at n=34A226822
- Number of (n+1) X (2+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=6A237631