Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …110101100000000001110001 |
3 | 111010002212100101111102211001 |
4 | 112233111211311200001301 |
5 | 101102031011113322433 |
6 | 552411545253122001 |
7 | 30031325401630213 |
oct | 2657254565400161 |
9 | 433085311442731 |
10 | 100010022010993 |
11 | 29959015195396 |
12 | b272742029301 |
13 | 43a5b9b56bc73 |
14 | 1a9a721c645b3 |
15 | b8675457957d |
hex | 5af565d60071 |
100010022010993 has 2 divisors, whose sum is σ = 100010022010994. Its totient is φ = 100010022010992.
The previous prime is 100010022010979. The next prime is 100010022011023. The reversal of 100010022010993 is 399010220010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83931469833744 + 16078552177249 = 9161412^2 + 4009807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010022010993 is a prime.
It is not a weakly prime, because it can be changed into another prime (100010022014993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005011005496 + 50005011005497.
It is an arithmetic number, because the mean of its divisors is an integer number (50005011005497).
Almost surely, 2100010022010993 is an apocalyptic number.
It is an amenable number.
100010022010993 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010022010993 is an equidigital number, since it uses as much as digits as its factorization.
100010022010993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 100010022010993 its reverse (399010220010001), we get a palindrome (499020242020994).
The spelling of 100010022010993 in words is "one hundred trillion, ten billion, twenty-two million, ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •