Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …101101110111001101101001 |
3 | 111010111101111202102102100110 |
4 | 112300330013231313031221 |
5 | 101110331442144201301 |
6 | 552534313341524533 |
7 | 30042303466144344 |
oct | 2660740755671551 |
9 | 433441452372313 |
10 | 100120112100201 |
11 | 299a0779177896 |
12 | b28bb46b73749 |
13 | 43b339461c59b |
14 | 1aa1ba6db945b |
15 | b8954951a0d6 |
hex | 5b0f07b77369 |
100120112100201 has 4 divisors (see below), whose sum is σ = 133493482800272. Its totient is φ = 66746741400132.
The previous prime is 100120112100181. The next prime is 100120112100233. The reversal of 100120112100201 is 102001211021001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 100120112100201 - 213 = 100120112092009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120112100251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16686685350031 + ... + 16686685350036.
It is an arithmetic number, because the mean of its divisors is an integer number (33373370700068).
Almost surely, 2100120112100201 is an apocalyptic number.
It is an amenable number.
100120112100201 is a deficient number, since it is larger than the sum of its proper divisors (33373370700071).
100120112100201 is an equidigital number, since it uses as much as digits as its factorization.
100120112100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33373370700070.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100120112100201 its reverse (102001211021001), we get a palindrome (202121323121202).
The spelling of 100120112100201 in words is "one hundred trillion, one hundred twenty billion, one hundred twelve million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •