Base | Representation |
---|---|
bin | 10110101111011111000101… |
… | …000110010111001000011001 |
3 | 111010010211122102101010020212 |
4 | 112233133011012113020121 |
5 | 101102212342302413423 |
6 | 552420352241300505 |
7 | 30032136023051336 |
oct | 2657370506271031 |
9 | 433124572333225 |
10 | 100020210201113 |
11 | 29962373156424 |
12 | b274706034735 |
13 | 43a6b3323a127 |
14 | 1a9b00adb398d |
15 | b86b4dc0c578 |
hex | 5af7c5197219 |
100020210201113 has 2 divisors, whose sum is σ = 100020210201114. Its totient is φ = 100020210201112.
The previous prime is 100020210201101. The next prime is 100020210201143. The reversal of 100020210201113 is 311102012020001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84840365639689 + 15179844561424 = 9210883^2 + 3896132^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020210201113 - 226 = 100020143092249 is a prime.
It is not a weakly prime, because it can be changed into another prime (100020210201143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010105100556 + 50010105100557.
It is an arithmetic number, because the mean of its divisors is an integer number (50010105100557).
Almost surely, 2100020210201113 is an apocalyptic number.
It is an amenable number.
100020210201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020210201113 is an equidigital number, since it uses as much as digits as its factorization.
100020210201113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100020210201113 its reverse (311102012020001), we get a palindrome (411122222221114).
The spelling of 100020210201113 in words is "one hundred trillion, twenty billion, two hundred ten million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •