Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …110100000101011110100111 |
3 | 111010210012221001202221000220 |
4 | 112302020121310011132213 |
5 | 101113202214121200012 |
6 | 553040101134335423 |
7 | 30051233316514530 |
oct | 2662103164053647 |
9 | 433705831687026 |
10 | 100202020100007 |
11 | 29a224900a3411 |
12 | b2a39a595a573 |
13 | 43bb018b29267 |
14 | 1aa5b37301687 |
15 | b8b74027708c |
hex | 5b2219d057a7 |
100202020100007 has 16 divisors (see below), whose sum is σ = 161670486212352. Its totient is φ = 53890162070400.
The previous prime is 100202020099999. The next prime is 100202020100047. The reversal of 100202020100007 is 700001020202001.
It is not a de Polignac number, because 100202020100007 - 23 = 100202020099999 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100202020100047) 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 15 ways as a sum of consecutive naturals, for example, 140338963369 + ... + 140338964082.
It is an arithmetic number, because the mean of its divisors is an integer number (10104405388272).
Almost surely, 2100202020100007 is an apocalyptic number.
100202020100007 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
100202020100007 is a deficient number, since it is larger than the sum of its proper divisors (61468466112345).
100202020100007 is a wasteful number, since it uses less digits than its factorization.
100202020100007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280677927478.
The product of its (nonzero) digits is 56, while the sum is 15.
Adding to 100202020100007 its reverse (700001020202001), we get a palindrome (800203040302008).
The spelling of 100202020100007 in words is "one hundred trillion, two hundred two billion, twenty million, one hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •