Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100010101111100110010100 |
3 | 112102111221212201100100010101 |
4 | 121000313310202233212110 |
5 | 103404410213111213022 |
6 | 1025550222433303444 |
7 | 32113016421025225 |
oct | 3100676442574624 |
9 | 472457781310111 |
10 | 110011100101012 |
11 | 3206449a0293a0 |
12 | 10408a7aa04b84 |
13 | 4950004b76576 |
14 | 1d247cc22b24c |
15 | cab993e76627 |
hex | 640df48af994 |
110011100101012 has 96 divisors (see below), whose sum is σ = 211029709726080. Its totient is φ = 49765646592000.
The previous prime is 110011100100977. The next prime is 110011100101027. The reversal of 110011100101012 is 210101001110011.
It is a self number, because there is not a number n which added to its sum of digits gives 110011100101012.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 15026782312 + ... + 15026789632.
It is an arithmetic number, because the mean of its divisors is an integer number (2198226142980).
Almost surely, 2110011100101012 is an apocalyptic number.
It is an amenable number.
110011100101012 is a deficient number, since it is larger than the sum of its proper divisors (101018609625068).
110011100101012 is a wasteful number, since it uses less digits than its factorization.
110011100101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9593 (or 9591 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110011100101012 its reverse (210101001110011), we get a palindrome (320112101211023).
The spelling of 110011100101012 in words is "one hundred ten trillion, eleven billion, one hundred million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •