Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …100100100011111110100001 |
3 | 111010002212210221101221001121 |
4 | 112233111300210203332201 |
5 | 101102031343220320342 |
6 | 552412015205332241 |
7 | 30031333016551513 |
oct | 2657256044437641 |
9 | 433085727357047 |
10 | 100010202120097 |
11 | 299590a7921a95 |
12 | b272792407081 |
13 | 43a5bc99806b9 |
14 | 1a9a73bb49bb3 |
15 | b867652a5067 |
hex | 5af570923fa1 |
100010202120097 has 2 divisors, whose sum is σ = 100010202120098. Its totient is φ = 100010202120096.
The previous prime is 100010202120089. The next prime is 100010202120167. The reversal of 100010202120097 is 790021202010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99492026735761 + 518175384336 = 9974569^2 + 719844^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010202120097 - 23 = 100010202120089 is a prime.
It is a super-2 number, since 2×1000102021200972 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100010202124097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005101060048 + 50005101060049.
It is an arithmetic number, because the mean of its divisors is an integer number (50005101060049).
Almost surely, 2100010202120097 is an apocalyptic number.
It is an amenable number.
100010202120097 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010202120097 is an equidigital number, since it uses as much as digits as its factorization.
100010202120097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 100010202120097 its reverse (790021202010001), we get a palindrome (890031404130098).
The spelling of 100010202120097 in words is "one hundred trillion, ten billion, two hundred two million, one hundred twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •