Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …101011000011100111000101 |
3 | 111010210010022202011102101000 |
4 | 112302013131223003213011 |
5 | 101113143132320200401 |
6 | 553035413052123513 |
7 | 30051166315251042 |
oct | 2662073553034705 |
9 | 433703282142330 |
10 | 100201011100101 |
11 | 29a2201259289a |
12 | b2a3763a66599 |
13 | 43babb7a8a7b2 |
14 | 1aa5a7d2d01c9 |
15 | b8b6d18b9186 |
hex | 5b21ddac39c5 |
100201011100101 has 8 divisors (see below), whose sum is σ = 148445942370560. Its totient is φ = 66800674066716.
The previous prime is 100201011100087. The next prime is 100201011100111. The reversal of 100201011100101 is 101001110102001.
It is not a de Polignac number, because 100201011100101 - 29 = 100201011099589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201011100111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1855574279605 + ... + 1855574279658.
It is an arithmetic number, because the mean of its divisors is an integer number (18555742796320).
Almost surely, 2100201011100101 is an apocalyptic number.
It is an amenable number.
100201011100101 is a deficient number, since it is larger than the sum of its proper divisors (48244931270459).
100201011100101 is an equidigital number, since it uses as much as digits as its factorization.
100201011100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3711148559272 (or 3711148559266 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100201011100101 its reverse (101001110102001), we get a palindrome (201202121202102).
The spelling of 100201011100101 in words is "one hundred trillion, two hundred one billion, eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •