Base | Representation |
---|---|
bin | 11110100100000011101… |
… | …001110111000110001101 |
3 | 21102210020112120200011111 |
4 | 132210003221313012031 |
5 | 233402403340003343 |
6 | 4244510432452021 |
7 | 304512254045422 |
oct | 36440351670615 |
9 | 7383215520144 |
10 | 2100300312973 |
11 | 73a806854525 |
12 | 29b0763aa011 |
13 | 1230993511a5 |
14 | 73925765d49 |
15 | 39978788c9d |
hex | 1e903a7718d |
2100300312973 has 2 divisors, whose sum is σ = 2100300312974. Its totient is φ = 2100300312972.
The previous prime is 2100300312949. The next prime is 2100300313019. The reversal of 2100300312973 is 3792130030012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1326187166404 + 774113146569 = 1151602^2 + 879837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2100300312973 is a prime.
It is a super-2 number, since 2×21003003129732 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100300312673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050150156486 + 1050150156487.
It is an arithmetic number, because the mean of its divisors is an integer number (1050150156487).
Almost surely, 22100300312973 is an apocalyptic number.
It is an amenable number.
2100300312973 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100300312973 is an equidigital number, since it uses as much as digits as its factorization.
2100300312973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 31.
Adding to 2100300312973 its reverse (3792130030012), we get a palindrome (5892430342985).
The spelling of 2100300312973 in words is "two trillion, one hundred billion, three hundred million, three hundred twelve thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •