Base | Representation |
---|---|
bin | 10110110010000111100011… |
… | …000101110110011011110111 |
3 | 111010210010120002020010110010 |
4 | 112302013203011312123313 |
5 | 101113143324103310403 |
6 | 553035430100431303 |
7 | 30051201501053553 |
oct | 2662074305663367 |
9 | 433703502203403 |
10 | 100201102010103 |
11 | 29a22059935926 |
12 | b2a378a3a8533 |
13 | 43bac0086a9b3 |
14 | 1aa5a8b3d6863 |
15 | b8b6d9875603 |
hex | 5b21e31766f7 |
100201102010103 has 8 divisors (see below), whose sum is σ = 133605770455168. Its totient is φ = 66798584119224.
The previous prime is 100201102010101. The next prime is 100201102010117. The reversal of 100201102010103 is 301010201102001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100201102010103 - 21 = 100201102010101 is a prime.
It is a super-2 number, since 2×1002011020101032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201102010101) 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, 537529825 + ... + 537716202.
It is an arithmetic number, because the mean of its divisors is an integer number (16700721306896).
Almost surely, 2100201102010103 is an apocalyptic number.
100201102010103 is a deficient number, since it is larger than the sum of its proper divisors (33404668445065).
100201102010103 is a wasteful number, since it uses less digits than its factorization.
100201102010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075277093.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 100201102010103 its reverse (301010201102001), we get a palindrome (401211303112104).
The spelling of 100201102010103 in words is "one hundred trillion, two hundred one billion, one hundred two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •