Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …110100100010110001101011 |
3 | 111010210012221002000000122111 |
4 | 112302020121310202301223 |
5 | 101113202214134020021 |
6 | 553040101141103151 |
7 | 30051233320524433 |
oct | 2662103164426153 |
9 | 433705832000574 |
10 | 100202020220011 |
11 | 29a22490175596 |
12 | b2a39a59b7ab7 |
13 | 43bb018b6ba78 |
14 | 1aa5b373332c3 |
15 | b8b74029c8e1 |
hex | 5b2219d22c6b |
100202020220011 has 4 divisors (see below), whose sum is σ = 100202068518112. Its totient is φ = 100201971921912.
The previous prime is 100202020219901. The next prime is 100202020220033. The reversal of 100202020220011 is 110022020202001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100202020220011 - 217 = 100202020088939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100202020219973 and 100202020220000.
It is not an unprimeable number, because it can be changed into a prime (100202020220611) 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, 20890500 + ... + 25235233.
It is an arithmetic number, because the mean of its divisors is an integer number (25050517129528).
Almost surely, 2100202020220011 is an apocalyptic number.
100202020220011 is a deficient number, since it is larger than the sum of its proper divisors (48298101).
100202020220011 is an equidigital number, since it uses as much as digits as its factorization.
100202020220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48298100.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100202020220011 its reverse (110022020202001), we get a palindrome (210224040422012).
The spelling of 100202020220011 in words is "one hundred trillion, two hundred two billion, twenty million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •