Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …110100100011000101111111 |
3 | 111010210012221002000002102122 |
4 | 112302020121310203011333 |
5 | 101113202214134040221 |
6 | 553040101141113155 |
7 | 30051233320531301 |
oct | 2662103164430577 |
9 | 433705832002378 |
10 | 100202020221311 |
11 | 29a22490176568 |
12 | b2a39a59b87bb |
13 | 43bb018b6c538 |
14 | 1aa5b37333971 |
15 | b8b74029ceab |
hex | 5b2219d2317f |
100202020221311 has 2 divisors, whose sum is σ = 100202020221312. Its totient is φ = 100202020221310.
The previous prime is 100202020221299. The next prime is 100202020221323. The reversal of 100202020221311 is 113122020202001.
It is a balanced prime because it is at equal distance from previous prime (100202020221299) and next prime (100202020221323).
It is a cyclic number.
It is not a de Polignac number, because 100202020221311 - 222 = 100202016027007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100202020221311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100202020521311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50101010110655 + 50101010110656.
It is an arithmetic number, because the mean of its divisors is an integer number (50101010110656).
Almost surely, 2100202020221311 is an apocalyptic number.
100202020221311 is a deficient number, since it is larger than the sum of its proper divisors (1).
100202020221311 is an equidigital number, since it uses as much as digits as its factorization.
100202020221311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 100202020221311 its reverse (113122020202001), we get a palindrome (213324040423312).
The spelling of 100202020221311 in words is "one hundred trillion, two hundred two billion, twenty million, two hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •