Base | Representation |
---|---|
bin | 1001000110000100111001… |
… | …11101100101111110100101 |
3 | 2121210222111110120112001012 |
4 | 10203002130331211332211 |
5 | 10110140000241402323 |
6 | 110311512414112005 |
7 | 4132644446404430 |
oct | 443023475457645 |
9 | 77728443515035 |
10 | 20000001122213 |
11 | 6410a53264192 |
12 | 22b0173aab605 |
13 | b20cb85b7778 |
14 | 4d2010470817 |
15 | 24a3a5008678 |
hex | 12309cf65fa5 |
20000001122213 has 8 divisors (see below), whose sum is σ = 23594471370240. Its totient is φ = 16589862681840.
The previous prime is 20000001122147. The next prime is 20000001122239. The reversal of 20000001122213 is 31222110000002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20000001122213 - 210 = 20000001121189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000001122113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46082951678 + ... + 46082952111.
It is an arithmetic number, because the mean of its divisors is an integer number (2949308921280).
Almost surely, 220000001122213 is an apocalyptic number.
It is an amenable number.
20000001122213 is a deficient number, since it is larger than the sum of its proper divisors (3594470248027).
20000001122213 is an equidigital number, since it uses as much as digits as its factorization.
20000001122213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92165903827.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20000001122213 its reverse (31222110000002), we get a palindrome (51222111122215).
It can be divided in two parts, 2000000 and 1122213, that added together give a palindrome (3122213).
The spelling of 20000001122213 in words is "twenty trillion, one million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •