Base | Representation |
---|---|
bin | 1001001001101010100110… |
… | …10101110010001011101101 |
3 | 2122020202210202210122200212 |
4 | 10210311103111302023231 |
5 | 10114200024410020021 |
6 | 110444305305432205 |
7 | 4144601425522151 |
oct | 444652325621355 |
9 | 78222722718625 |
10 | 20123320001261 |
11 | 6459285588254 |
12 | 231004b19b665 |
13 | b2c80c264299 |
14 | 4d7d8c4a9061 |
15 | 24d6c154085b |
hex | 124d535722ed |
20123320001261 has 2 divisors, whose sum is σ = 20123320001262. Its totient is φ = 20123320001260.
The previous prime is 20123320001209. The next prime is 20123320001287. The reversal of 20123320001261 is 16210002332102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11828165424100 + 8295154577161 = 3439210^2 + 2880131^2 .
It is a cyclic number.
It is not a de Polignac number, because 20123320001261 - 214 = 20123319984877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20123320001861) 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, 10061660000630 + 10061660000631.
It is an arithmetic number, because the mean of its divisors is an integer number (10061660000631).
Almost surely, 220123320001261 is an apocalyptic number.
It is an amenable number.
20123320001261 is a deficient number, since it is larger than the sum of its proper divisors (1).
20123320001261 is an equidigital number, since it uses as much as digits as its factorization.
20123320001261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20123320001261 its reverse (16210002332102), we get a palindrome (36333322333363).
The spelling of 20123320001261 in words is "twenty trillion, one hundred twenty-three billion, three hundred twenty million, one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •