Base | Representation |
---|---|
bin | 1001001111101111101111… |
… | …00010110001110010100001 |
3 | 2122222202001022000220000111 |
4 | 10213313313202301302201 |
5 | 10131110403211114103 |
6 | 111124255442451321 |
7 | 4165645460340214 |
oct | 447676742616241 |
9 | 78882038026014 |
10 | 20332233301153 |
11 | 65299407025a4 |
12 | 2344633963b41 |
13 | b464240987b7 |
14 | 50412a27377b |
15 | 253d4c26786d |
hex | 127df78b1ca1 |
20332233301153 has 2 divisors, whose sum is σ = 20332233301154. Its totient is φ = 20332233301152.
The previous prime is 20332233301141. The next prime is 20332233301181. The reversal of 20332233301153 is 35110333223302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19892920181904 + 439313119249 = 4460148^2 + 662807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20332233301153 is a prime.
It is a super-2 number, since 2×203322333011532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20332233301253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10166116650576 + 10166116650577.
It is an arithmetic number, because the mean of its divisors is an integer number (10166116650577).
Almost surely, 220332233301153 is an apocalyptic number.
It is an amenable number.
20332233301153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20332233301153 is an equidigital number, since it uses as much as digits as its factorization.
20332233301153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 31.
Adding to 20332233301153 its reverse (35110333223302), we get a palindrome (55442566524455).
The spelling of 20332233301153 in words is "twenty trillion, three hundred thirty-two billion, two hundred thirty-three million, three hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •