Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …100110101101010111100101 |
3 | 111010102110121212212211110000 |
4 | 112300221121212231113211 |
5 | 101110014310321320401 |
6 | 552521151004051513 |
7 | 30040662406503666 |
oct | 2660513146552745 |
9 | 433373555784400 |
10 | 100100011120101 |
11 | 299931a3747a43 |
12 | b288077233b99 |
13 | 43b151004a015 |
14 | 1aa0c1b52936d |
15 | b88c6e9a4186 |
hex | 5b0a599ad5e5 |
100100011120101 has 20 divisors (see below), whose sum is σ = 150113952432972. Its totient is φ = 66473677928448.
The previous prime is 100100011120069. The next prime is 100100011120169. The reversal of 100100011120101 is 101021110001001.
It can be written as a sum of positive squares in 2 ways, for example, as 92271201524100 + 7828809596001 = 9605790^2 + 2798001^2 .
It is not a de Polignac number, because 100100011120101 - 25 = 100100011120069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100100011170101) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2404264410 + ... + 2404306043.
Almost surely, 2100100011120101 is an apocalyptic number.
It is an amenable number.
100100011120101 is a deficient number, since it is larger than the sum of its proper divisors (50013941312871).
100100011120101 is an equidigital number, since it uses as much as digits as its factorization.
100100011120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4808570722 (or 4808570713 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100100011120101 its reverse (101021110001001), we get a palindrome (201121121121102).
The spelling of 100100011120101 in words is "one hundred trillion, one hundred billion, eleven million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •