Base | Representation |
---|---|
bin | 1001000111010110111011… |
… | …1100110000011010100101 |
3 | 1022111002120210222100212201 |
4 | 2101311232330300122211 |
5 | 2303200044122403102 |
6 | 33152015200414501 |
7 | 2053032000321442 |
oct | 221655674603245 |
9 | 38432523870781 |
10 | 10022020122277 |
11 | 32143510a3889 |
12 | 115a402317431 |
13 | 5790c3204487 |
14 | 2690d582a9c9 |
15 | 125a681e8987 |
hex | 91d6ef306a5 |
10022020122277 has 2 divisors, whose sum is σ = 10022020122278. Its totient is φ = 10022020122276.
The previous prime is 10022020122217. The next prime is 10022020122371. The reversal of 10022020122277 is 77222102022001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9945703849761 + 76316272516 = 3153681^2 + 276254^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10022020122277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022020122217) 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, 5011010061138 + 5011010061139.
It is an arithmetic number, because the mean of its divisors is an integer number (5011010061139).
Almost surely, 210022020122277 is an apocalyptic number.
It is an amenable number.
10022020122277 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022020122277 is an equidigital number, since it uses as much as digits as its factorization.
10022020122277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3136, while the sum is 28.
Adding to 10022020122277 its reverse (77222102022001), we get a palindrome (87244122144278).
The spelling of 10022020122277 in words is "ten trillion, twenty-two billion, twenty million, one hundred twenty-two thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •