Base | Representation |
---|---|
bin | 1001000110110000010100… |
… | …11101010110011010010001 |
3 | 2121220012200002222121122012 |
4 | 10203120022131112122101 |
5 | 10111030221112000311 |
6 | 110330325532352305 |
7 | 4134431235164066 |
oct | 443301235263221 |
9 | 77805602877565 |
10 | 20023313000081 |
11 | 641a926200056 |
12 | 22b479b015695 |
13 | b23262172c41 |
14 | 4d31c2544c6d |
15 | 24acbb8c178b |
hex | 12360a756691 |
20023313000081 has 2 divisors, whose sum is σ = 20023313000082. Its totient is φ = 20023313000080.
The previous prime is 20023312999897. The next prime is 20023313000099. The reversal of 20023313000081 is 18000031332002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19898816934481 + 124496065600 = 4460809^2 + 352840^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20023313000081 is a prime.
It is a super-2 number, since 2×200233130000812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20023313000381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011656500040 + 10011656500041.
It is an arithmetic number, because the mean of its divisors is an integer number (10011656500041).
Almost surely, 220023313000081 is an apocalyptic number.
It is an amenable number.
20023313000081 is a deficient number, since it is larger than the sum of its proper divisors (1).
20023313000081 is an equidigital number, since it uses as much as digits as its factorization.
20023313000081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20023313000081 its reverse (18000031332002), we get a palindrome (38023344332083).
The spelling of 20023313000081 in words is "twenty trillion, twenty-three billion, three hundred thirteen million, eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •