Base | Representation |
---|---|
bin | 101110100111001111… |
… | …1011011110110100001 |
3 | 100120101012220022202000 |
4 | 1131032133123312201 |
5 | 3120001341024301 |
6 | 113552534114213 |
7 | 10142412256230 |
oct | 1351637336641 |
9 | 316335808660 |
10 | 100101111201 |
11 | 394a8516483 |
12 | 174977ab969 |
13 | 9593751c60 |
14 | 4bb8660b17 |
15 | 290d05d786 |
hex | 174e7dbda1 |
100101111201 has 32 divisors (see below), whose sum is σ = 182520549120. Its totient is φ = 52800584832.
The previous prime is 100101111191. The next prime is 100101111223. The reversal of 100101111201 is 102111101001.
It is not a de Polignac number, because 100101111201 - 215 = 100101078433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100101111001) by changing a digit.
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, 20368140 + ... + 20373053.
It is an arithmetic number, because the mean of its divisors is an integer number (5703767160).
Almost surely, 2100101111201 is an apocalyptic number.
It is an amenable number.
100101111201 is a deficient number, since it is larger than the sum of its proper divisors (82419437919).
100101111201 is a wasteful number, since it uses less digits than its factorization.
100101111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40741222 (or 40741216 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100101111201 its reverse (102111101001), we get a palindrome (202212212202).
It can be divided in two parts, 10010 and 1111201, that added together give a palindrome (1121211).
The spelling of 100101111201 in words is "one hundred billion, one hundred one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •