Base | Representation |
---|---|
bin | 10110110000110011110101… |
… | …010010111010111101110001 |
3 | 111010110112112120102001010100 |
4 | 112300303311102322331301 |
5 | 101110210231024110301 |
6 | 552530242325423013 |
7 | 30041540121045003 |
oct | 2660636522727561 |
9 | 433415476361110 |
10 | 100111213113201 |
11 | 29997a219aa184 |
12 | b28a28286aa69 |
13 | 43b25a6a78bc4 |
14 | 1aa15a117a373 |
15 | b891c8143286 |
hex | 5b0cf54baf71 |
100111213113201 has 12 divisors (see below), whose sum is σ = 144643968443520. Its totient is φ = 66722862818040.
The previous prime is 100111213113173. The next prime is 100111213113227. The reversal of 100111213113201 is 102311312111001.
100111213113201 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 11 + 21 + 311 + 320 + 1 = 666.
It is not a de Polignac number, because 100111213113201 - 229 = 100110676242289 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100111213113251) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1495458345 + ... + 1495525286.
It is an arithmetic number, because the mean of its divisors is an integer number (12053664036960).
Almost surely, 2100111213113201 is an apocalyptic number.
It is an amenable number.
100111213113201 is a deficient number, since it is larger than the sum of its proper divisors (44532755330319).
100111213113201 is a wasteful number, since it uses less digits than its factorization.
100111213113201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2990987356 (or 2990987353 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 100111213113201 its reverse (102311312111001), we get a palindrome (202422525224202).
The spelling of 100111213113201 in words is "one hundred trillion, one hundred eleven billion, two hundred thirteen million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •