Base | Representation |
---|---|
bin | 110110000010011010… |
… | …0100110101111000111 |
3 | 102002112101011121101211 |
4 | 1230010310212233013 |
5 | 3400130011003012 |
6 | 125151011232251 |
7 | 11245463234554 |
oct | 1540464465707 |
9 | 362471147354 |
10 | 116045016007 |
11 | 4523a428108 |
12 | 1a5a72a8687 |
13 | ac349c765b |
14 | 588bd8da2b |
15 | 3042b736a7 |
hex | 1b04d26bc7 |
116045016007 has 8 divisors (see below), whose sum is σ = 116572946256. Its totient is φ = 115517341632.
The previous prime is 116045015981. The next prime is 116045016019. The reversal of 116045016007 is 700610540611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116045016007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116045016007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116045016047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 876453 + ... + 1000129.
It is an arithmetic number, because the mean of its divisors is an integer number (14571618282).
Almost surely, 2116045016007 is an apocalyptic number.
116045016007 is a deficient number, since it is larger than the sum of its proper divisors (527930249).
116045016007 is a wasteful number, since it uses less digits than its factorization.
116045016007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127937.
The product of its (nonzero) digits is 5040, while the sum is 31.
Adding to 116045016007 its reverse (700610540611), we get a palindrome (816655556618).
The spelling of 116045016007 in words is "one hundred sixteen billion, forty-five million, sixteen thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •