Base | Representation |
---|---|
bin | 1001010000100111110011… |
… | …00100010010011010110101 |
3 | 2200002121201221002100120001 |
4 | 10220103321210102122311 |
5 | 10132104023444204303 |
6 | 111150154242511301 |
7 | 4201062366264241 |
oct | 450237144223265 |
9 | 80077657070501 |
10 | 20362332022453 |
11 | 6540686644383 |
12 | 234a433965531 |
13 | b4920ca47365 |
14 | 505783859421 |
15 | 254a0e89231d |
hex | 1284f99126b5 |
20362332022453 has 16 divisors (see below), whose sum is σ = 20719113292800. Its totient is φ = 20005942904640.
The previous prime is 20362332022451. The next prime is 20362332022471. The reversal of 20362332022453 is 35422023326302.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20362332022453 - 21 = 20362332022451 is a prime.
It is a super-2 number, since 2×203623320224532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20362332022451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 878697775 + ... + 878720947.
It is an arithmetic number, because the mean of its divisors is an integer number (1294944580800).
Almost surely, 220362332022453 is an apocalyptic number.
It is an amenable number.
20362332022453 is a deficient number, since it is larger than the sum of its proper divisors (356781270347).
20362332022453 is a wasteful number, since it uses less digits than its factorization.
20362332022453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30972.
The product of its (nonzero) digits is 311040, while the sum is 37.
Adding to 20362332022453 its reverse (35422023326302), we get a palindrome (55784355348755).
The spelling of 20362332022453 in words is "twenty trillion, three hundred sixty-two billion, three hundred thirty-two million, twenty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •