Base | Representation |
---|---|
bin | 1001000111001111110110… |
… | …1101001101010110100101 |
3 | 1022110220200101222101102012 |
4 | 2101303331231031112211 |
5 | 2303132201234033333 |
6 | 33151102451124005 |
7 | 2052633630403103 |
oct | 221637555152645 |
9 | 38426611871365 |
10 | 10020120221093 |
11 | 3213566705a14 |
12 | 1159b71ba3605 |
13 | 578b7c7068a8 |
14 | 268d9538ac73 |
15 | 1259a6509e48 |
hex | 91cfdb4d5a5 |
10020120221093 has 2 divisors, whose sum is σ = 10020120221094. Its totient is φ = 10020120221092.
The previous prime is 10020120221047. The next prime is 10020120221171. The reversal of 10020120221093 is 39012202102001.
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., 9912718511809 + 107401709284 = 3148447^2 + 327722^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020120221093 - 220 = 10020119172517 is a prime.
It is a super-2 number, since 2×100201202210932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020120221693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010060110546 + 5010060110547.
It is an arithmetic number, because the mean of its divisors is an integer number (5010060110547).
Almost surely, 210020120221093 is an apocalyptic number.
It is an amenable number.
10020120221093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020120221093 is an equidigital number, since it uses as much as digits as its factorization.
10020120221093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 10020120221093 its reverse (39012202102001), we get a palindrome (49032322323094).
The spelling of 10020120221093 in words is "ten trillion, twenty billion, one hundred twenty million, two hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •