Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …01000100101111011111001 |
3 | 2122012200120212210210220122 |
4 | 10210222300220211323321 |
5 | 10114003334034423113 |
6 | 110435154141303025 |
7 | 4144021054660631 |
oct | 444526050457371 |
9 | 78180525723818 |
10 | 20112000311033 |
11 | 64544a6947464 |
12 | 2309a10264a75 |
13 | b2b727036727 |
14 | 4d75d6d7b6c1 |
15 | 24d25c8a3408 |
hex | 124ab0a25ef9 |
20112000311033 has 4 divisors (see below), whose sum is σ = 20112275179620. Its totient is φ = 20111725442448.
The previous prime is 20112000311027. The next prime is 20112000311083. The reversal of 20112000311033 is 33011300021102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17721473057344 + 2390527253689 = 4209688^2 + 1546133^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112000311033 - 216 = 20112000245497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112000311083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 137324510 + ... + 137470887.
It is an arithmetic number, because the mean of its divisors is an integer number (5028068794905).
Almost surely, 220112000311033 is an apocalyptic number.
It is an amenable number.
20112000311033 is a deficient number, since it is larger than the sum of its proper divisors (274868587).
20112000311033 is an equidigital number, since it uses as much as digits as its factorization.
20112000311033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274868586.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20112000311033 its reverse (33011300021102), we get a palindrome (53123300332135).
The spelling of 20112000311033 in words is "twenty trillion, one hundred twelve billion, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •