Base | Representation |
---|---|
bin | 110110000100000011… |
… | …0011001001010101001 |
3 | 102002200012122121220000 |
4 | 1230020012121022221 |
5 | 3400233100320130 |
6 | 125200254053213 |
7 | 11250031544052 |
oct | 1541006311251 |
9 | 362605577800 |
10 | 116100010665 |
11 | 4526847a441 |
12 | 1a6017aa209 |
13 | ac43211282 |
14 | 58953c7729 |
15 | 30478d8260 |
hex | 1b081992a9 |
116100010665 has 40 divisors (see below), whose sum is σ = 210971032008. Its totient is φ = 61071770880.
The previous prime is 116100010603. The next prime is 116100010709. The reversal of 116100010665 is 566010001611.
It can be written as a sum of positive squares in 4 ways, for example, as 2396304 + 116097614361 = 1548^2 + 340731^2 .
It is not a de Polignac number, because 116100010665 - 26 = 116100010601 is a prime.
It is a super-2 number, since 2×1161000106652 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1933906 + ... + 1993035.
Almost surely, 2116100010665 is an apocalyptic number.
116100010665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116100010665 is a deficient number, since it is larger than the sum of its proper divisors (94871021343).
116100010665 is an equidigital number, since it uses as much as digits as its factorization.
116100010665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3927031 (or 3927022 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 116100010665 in words is "one hundred sixteen billion, one hundred million, ten thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •