Base | Representation |
---|---|
bin | 1001000110110000001000… |
… | …11001001000011110001001 |
3 | 2121220012102000111012212011 |
4 | 10203120010121020132021 |
5 | 10111030014033343423 |
6 | 110330311455215521 |
7 | 4134425561153416 |
oct | 443300431103611 |
9 | 77805360435764 |
10 | 20023211231113 |
11 | 641a883810572 |
12 | 22b4770b175a1 |
13 | b2324706020c |
14 | 4d31b2c1310d |
15 | 24acb29bcb0d |
hex | 123604648789 |
20023211231113 has 2 divisors, whose sum is σ = 20023211231114. Its totient is φ = 20023211231112.
The previous prime is 20023211231087. The next prime is 20023211231123. The reversal of 20023211231113 is 31113211232002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10464429205129 + 9558782025984 = 3234877^2 + 3091728^2 .
It is a cyclic number.
It is not a de Polignac number, because 20023211231113 - 225 = 20023177676681 is a prime.
It is not a weakly prime, because it can be changed into another prime (20023211231123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011605615556 + 10011605615557.
It is an arithmetic number, because the mean of its divisors is an integer number (10011605615557).
Almost surely, 220023211231113 is an apocalyptic number.
It is an amenable number.
20023211231113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20023211231113 is an equidigital number, since it uses as much as digits as its factorization.
20023211231113 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 22.
Adding to 20023211231113 its reverse (31113211232002), we get a palindrome (51136422463115).
The spelling of 20023211231113 in words is "twenty trillion, twenty-three billion, two hundred eleven million, two hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •