Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001100111101110111001101 |
3 | 111010002000001202210102201201 |
4 | 112233031030030331313031 |
5 | 101101404023004122201 |
6 | 552403454235305501 |
7 | 30030556024156234 |
oct | 2657151414756715 |
9 | 433060052712651 |
10 | 100001002020301 |
11 | 2995520668a928 |
12 | b270a452ab291 |
13 | 43a509190c875 |
14 | 1a9a107d27b1b |
15 | b863c774e801 |
hex | 5af34c33ddcd |
100001002020301 has 2 divisors, whose sum is σ = 100001002020302. Its totient is φ = 100001002020300.
The previous prime is 100001002020259. The next prime is 100001002020341. The reversal of 100001002020301 is 103020200100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63534210597225 + 36466791423076 = 7970835^2 + 6038774^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001002020301 - 237 = 99863563066829 is a prime.
It is a super-2 number, since 2×1000010020203012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001002020341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000501010150 + 50000501010151.
It is an arithmetic number, because the mean of its divisors is an integer number (50000501010151).
Almost surely, 2100001002020301 is an apocalyptic number.
It is an amenable number.
100001002020301 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001002020301 is an equidigital number, since it uses as much as digits as its factorization.
100001002020301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 100001002020301 its reverse (103020200100001), we get a palindrome (203021202120302).
The spelling of 100001002020301 in words is "one hundred trillion, one billion, two million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •