Base | Representation |
---|---|
bin | 10110110000110010101100… |
… | …111111101011110111011001 |
3 | 111010110102102000221011000022 |
4 | 112300302230333223313121 |
5 | 101110200240012023230 |
6 | 552525522114520225 |
7 | 30041465061514430 |
oct | 2660625477536731 |
9 | 433412360834008 |
10 | 100110000111065 |
11 | 2999745a22277a |
12 | b289ba4596075 |
13 | 43b2442681569 |
14 | 1aa14c8024117 |
15 | b891568da1e5 |
hex | 5b0cacfebdd9 |
100110000111065 has 64 divisors (see below), whose sum is σ = 146103110968320. Its totient is φ = 64283505745920.
The previous prime is 100110000111001. The next prime is 100110000111067. The reversal of 100110000111065 is 560111000011001.
It is not a de Polignac number, because 100110000111065 - 26 = 100110000111001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100110000111067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 126200975 + ... + 126991755.
It is an arithmetic number, because the mean of its divisors is an integer number (2282861108880).
Almost surely, 2100110000111065 is an apocalyptic number.
It is an amenable number.
100110000111065 is a deficient number, since it is larger than the sum of its proper divisors (45993110857255).
100110000111065 is a wasteful number, since it uses less digits than its factorization.
100110000111065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791882.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 100110000111065 its reverse (560111000011001), we get a palindrome (660221000122066).
The spelling of 100110000111065 in words is "one hundred trillion, one hundred ten billion, one hundred eleven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •