Base | Representation |
---|---|
bin | 1001001001010101101111… |
… | …10001010010111111001111 |
3 | 2122012200220020002022220010 |
4 | 10210222313301102333033 |
5 | 10114004110212030411 |
6 | 110435214055324303 |
7 | 4144024040414142 |
oct | 444526761227717 |
9 | 78180806068803 |
10 | 20112120033231 |
11 | 6454558489526 |
12 | 2309a44380693 |
13 | b2b745a94075 |
14 | 4d7608c24059 |
15 | 24d2681517a6 |
hex | 124ab7c52fcf |
20112120033231 has 64 divisors (see below), whose sum is σ = 27465774796800. Its totient is φ = 13088065536000.
The previous prime is 20112120033221. The next prime is 20112120033263. The reversal of 20112120033231 is 13233002121102.
It is not a de Polignac number, because 20112120033231 - 25 = 20112120033199 is a prime.
It is a super-2 number, since 2×201121200332312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20112120033198 and 20112120033207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112120033221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12562222831 + ... + 12562224431.
It is an arithmetic number, because the mean of its divisors is an integer number (429152731200).
Almost surely, 220112120033231 is an apocalyptic number.
20112120033231 is a deficient number, since it is larger than the sum of its proper divisors (7353654763569).
20112120033231 is a wasteful number, since it uses less digits than its factorization.
20112120033231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3160.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20112120033231 its reverse (13233002121102), we get a palindrome (33345122154333).
The spelling of 20112120033231 in words is "twenty trillion, one hundred twelve billion, one hundred twenty million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •