Base | Representation |
---|---|
bin | 1111001001011100111101… |
… | …0011011111100000000001 |
3 | 2011222012122012101122211010 |
4 | 3302113033103133200001 |
5 | 4140334033421400230 |
6 | 55231122022111133 |
7 | 3336201031603026 |
oct | 362271723374001 |
9 | 64865565348733 |
10 | 16655066200065 |
11 | 5341412745117 |
12 | 1a4ba43b7b4a9 |
13 | 93a748682147 |
14 | 4181766a754d |
15 | 1dd38326e9b0 |
hex | f25cf4df801 |
16655066200065 has 16 divisors (see below), whose sum is σ = 26673174718848. Its totient is φ = 8874345707136.
The previous prime is 16655066200063. The next prime is 16655066200151. The reversal of 16655066200065 is 56000266055661.
It is not a de Polignac number, because 16655066200065 - 21 = 16655066200063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16655066199987 and 16655066200023.
It is not an unprimeable number, because it can be changed into a prime (16655066200063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 522250164 + ... + 522282053.
It is an arithmetic number, because the mean of its divisors is an integer number (1667073419928).
Almost surely, 216655066200065 is an apocalyptic number.
16655066200065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16655066200065 is a deficient number, since it is larger than the sum of its proper divisors (10018108518783).
16655066200065 is a wasteful number, since it uses less digits than its factorization.
16655066200065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044533288.
The product of its (nonzero) digits is 1944000, while the sum is 48.
The spelling of 16655066200065 in words is "sixteen trillion, six hundred fifty-five billion, sixty-six million, two hundred thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •