Base | Representation |
---|---|
bin | 1001000110010111100010… |
… | …01011100101100000001110 |
3 | 2121211221022120202220212111 |
4 | 10203023301023211200032 |
5 | 10110320442011323042 |
6 | 110320245142454234 |
7 | 4133450360510524 |
oct | 443136113454016 |
9 | 77757276686774 |
10 | 20010004011022 |
11 | 6415216671643 |
12 | 22b20a5a3437a |
13 | b21c20a76a9c |
14 | 4d26bcb46314 |
15 | 24a78d287517 |
hex | 1232f12e580e |
20010004011022 has 8 divisors (see below), whose sum is σ = 30015032180256. Its totient is φ = 10004993284272.
The previous prime is 20010004011013. The next prime is 20010004011031. The reversal of 20010004011022 is 22011040001002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20010004011013) and next prime (20010004011031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×200100040110222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20010004010993 and 20010004011011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 963238 + ... + 6399049.
It is an arithmetic number, because the mean of its divisors is an integer number (3751879022532).
Almost surely, 220010004011022 is an apocalyptic number.
20010004011022 is a deficient number, since it is larger than the sum of its proper divisors (10005028169234).
20010004011022 is a wasteful number, since it uses less digits than its factorization.
20010004011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8721242.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20010004011022 its reverse (22011040001002), we get a palindrome (42021044012024).
The spelling of 20010004011022 in words is "twenty trillion, ten billion, four million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •