Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …100101011000110100110101 |
3 | 111010002212021220222110211111 |
4 | 112233111210211120310311 |
5 | 101102030440224304343 |
6 | 552411543223035021 |
7 | 30031325025261565 |
oct | 2657254445306465 |
9 | 433085256873744 |
10 | 100010001009973 |
11 | 29959004350a7a |
12 | b272736b9ba71 |
13 | 43a5b970c8022 |
14 | 1a9a71d158da5 |
15 | b867527cbc9d |
hex | 5af564958d35 |
100010001009973 has 2 divisors, whose sum is σ = 100010001009974. Its totient is φ = 100010001009972.
The previous prime is 100010001009931. The next prime is 100010001010033. The reversal of 100010001009973 is 379900100010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64777917631729 + 35232083378244 = 8048473^2 + 5935662^2 .
It is an emirp because it is prime and its reverse (379900100010001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100010001009973 - 217 = 100010000878901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010001009923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005000504986 + 50005000504987.
It is an arithmetic number, because the mean of its divisors is an integer number (50005000504987).
Almost surely, 2100010001009973 is an apocalyptic number.
It is an amenable number.
100010001009973 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010001009973 is an equidigital number, since it uses as much as digits as its factorization.
100010001009973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 31.
Adding to 100010001009973 its reverse (379900100010001), we get a palindrome (479910101019974).
The spelling of 100010001009973 in words is "one hundred trillion, ten billion, one million, nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •