Base | Representation |
---|---|
bin | 1001001001100100011101… |
… | …01001101011000010100011 |
3 | 2122020110021210110110202000 |
4 | 10210302032221223002203 |
5 | 10114121300121301311 |
6 | 110443002025255043 |
7 | 4144423566043401 |
oct | 444621651530243 |
9 | 78213253413660 |
10 | 20120020103331 |
11 | 6457941903085 |
12 | 230b48a034483 |
13 | b2c4046b9565 |
14 | 4d7b58118471 |
15 | 24d57b9ad056 |
hex | 124c8ea6b0a3 |
20120020103331 has 16 divisors (see below), whose sum is σ = 29836631586720. Its totient is φ = 13400209257120.
The previous prime is 20120020103269. The next prime is 20120020103377. The reversal of 20120020103331 is 13330102002102.
20120020103331 is a `hidden beast` number, since 201 + 200 + 201 + 0 + 33 + 31 = 666.
It is not a de Polignac number, because 20120020103331 - 222 = 20120015909027 is a prime.
It is a super-2 number, since 2×201200201033312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20120020103731) 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, 364901880 + ... + 364957013.
It is an arithmetic number, because the mean of its divisors is an integer number (1864789474170).
Almost surely, 220120020103331 is an apocalyptic number.
20120020103331 is a deficient number, since it is larger than the sum of its proper divisors (9716611483389).
20120020103331 is a wasteful number, since it uses less digits than its factorization.
20120020103331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729859923 (or 729859917 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 20120020103331 its reverse (13330102002102), we get a palindrome (33450122105433).
The spelling of 20120020103331 in words is "twenty trillion, one hundred twenty billion, twenty million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •