Base | Representation |
---|---|
bin | 1001001001101110101110… |
… | …01111110100011101011001 |
3 | 2122020222112000000011201212 |
4 | 10210313113033310131121 |
5 | 10114214042423431413 |
6 | 110445313042352505 |
7 | 4145010320124521 |
oct | 444672717643531 |
9 | 78228460004655 |
10 | 20125533030233 |
11 | 645a2107a6714 |
12 | 231056835b735 |
13 | b2caa28a8097 |
14 | 4d811c378681 |
15 | 24d7a0982ca8 |
hex | 124dd73f4759 |
20125533030233 has 2 divisors, whose sum is σ = 20125533030234. Its totient is φ = 20125533030232.
The previous prime is 20125533030199. The next prime is 20125533030289. The reversal of 20125533030233 is 33203033552102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19881539512384 + 243993517849 = 4458872^2 + 493957^2 .
It is a cyclic number.
It is not a de Polignac number, because 20125533030233 - 28 = 20125533029977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20125533030233.
It is not a weakly prime, because it can be changed into another prime (20125533030833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10062766515116 + 10062766515117.
It is an arithmetic number, because the mean of its divisors is an integer number (10062766515117).
Almost surely, 220125533030233 is an apocalyptic number.
It is an amenable number.
20125533030233 is a deficient number, since it is larger than the sum of its proper divisors (1).
20125533030233 is an equidigital number, since it uses as much as digits as its factorization.
20125533030233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48600, while the sum is 32.
Adding to 20125533030233 its reverse (33203033552102), we get a palindrome (53328566582335).
The spelling of 20125533030233 in words is "twenty trillion, one hundred twenty-five billion, five hundred thirty-three million, thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •