Base | Representation |
---|---|
bin | 1010000000110111101001… |
… | …10101110101010100001101 |
3 | 2212222002202100000220011021 |
4 | 11000123310311311110031 |
5 | 10341234141142041023 |
6 | 114455522100354141 |
7 | 4431620566453066 |
oct | 500336465652415 |
9 | 85862670026137 |
10 | 22020110112013 |
11 | 701a749105702 |
12 | 257778a3a5951 |
13 | c39644c97070 |
14 | 561ac989756d |
15 | 282bd85d035d |
hex | 1406f4d7550d |
22020110112013 has 8 divisors (see below), whose sum is σ = 23785608138656. Its totient is φ = 20264846857200.
The previous prime is 22020110111963. The next prime is 22020110112017. The reversal of 22020110112013 is 31021101102022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22020110112013 - 229 = 22019573241101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22020110112017) 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, 2558688483 + ... + 2558697088.
It is an arithmetic number, because the mean of its divisors is an integer number (2973201017332).
Almost surely, 222020110112013 is an apocalyptic number.
It is an amenable number.
22020110112013 is a deficient number, since it is larger than the sum of its proper divisors (1765498026643).
22020110112013 is a wasteful number, since it uses less digits than its factorization.
22020110112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5117385915.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 22020110112013 its reverse (31021101102022), we get a palindrome (53041211214035).
Subtracting 22020110112013 from its reverse (31021101102022), we obtain a palindrome (9000990990009).
The spelling of 22020110112013 in words is "twenty-two trillion, twenty billion, one hundred ten million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •