Base | Representation |
---|---|
bin | 10010110001001001… |
… | …111110101110011001 |
3 | 1221000102122100020202 |
4 | 102301021332232121 |
5 | 312232411141013 |
6 | 13131400231545 |
7 | 1312246423016 |
oct | 226111765631 |
9 | 57012570222 |
10 | 20152052633 |
11 | 8601343459 |
12 | 3aa4a6b5b5 |
13 | 1b92044bcb |
14 | d9258670d |
15 | 7ce2a3858 |
hex | 4b127eb99 |
20152052633 has 2 divisors, whose sum is σ = 20152052634. Its totient is φ = 20152052632.
The previous prime is 20152052497. The next prime is 20152052647. The reversal of 20152052633 is 33625025102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16994511769 + 3157540864 = 130363^2 + 56192^2 .
It is a cyclic number.
It is not a de Polignac number, because 20152052633 - 28 = 20152052377 is a prime.
It is a super-2 number, since 2×201520526332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20152052596 and 20152052605.
It is not a weakly prime, because it can be changed into another prime (20152054633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10076026316 + 10076026317.
It is an arithmetic number, because the mean of its divisors is an integer number (10076026317).
Almost surely, 220152052633 is an apocalyptic number.
It is an amenable number.
20152052633 is a deficient number, since it is larger than the sum of its proper divisors (1).
20152052633 is an equidigital number, since it uses as much as digits as its factorization.
20152052633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 20152052633 its reverse (33625025102), we get a palindrome (53777077735).
The spelling of 20152052633 in words is "twenty billion, one hundred fifty-two million, fifty-two thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •