Base | Representation |
---|---|
bin | 10011000011001110… |
… | …000110100010111101 |
3 | 1221210112220220211002 |
4 | 103003032012202331 |
5 | 313343002420013 |
6 | 13221424140045 |
7 | 1322616451334 |
oct | 230316064275 |
9 | 57715826732 |
10 | 20455123133 |
11 | 8747424845 |
12 | 3b6a467625 |
13 | 1c0ca79473 |
14 | dc0918d1b |
15 | 7eabbc358 |
hex | 4c33868bd |
20455123133 has 2 divisors, whose sum is σ = 20455123134. Its totient is φ = 20455123132.
The previous prime is 20455123127. The next prime is 20455123141. The reversal of 20455123133 is 33132155402.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19364670649 + 1090452484 = 139157^2 + 33022^2 .
It is a cyclic number.
It is not a de Polignac number, because 20455123133 - 26 = 20455123069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20455123096 and 20455123105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20455123153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10227561566 + 10227561567.
It is an arithmetic number, because the mean of its divisors is an integer number (10227561567).
Almost surely, 220455123133 is an apocalyptic number.
It is an amenable number.
20455123133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20455123133 is an equidigital number, since it uses as much as digits as its factorization.
20455123133 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 20455123133 its reverse (33132155402), we get a palindrome (53587278535).
The spelling of 20455123133 in words is "twenty billion, four hundred fifty-five million, one hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •