Base | Representation |
---|---|
bin | 1010000000101010100111… |
… | …01010110011110001000101 |
3 | 2212221102200120012102012110 |
4 | 11000111103222303301011 |
5 | 10341130322421414023 |
6 | 114452403400011233 |
7 | 4431252262154253 |
oct | 500252352636105 |
9 | 85842616172173 |
10 | 22013111123013 |
11 | 701778739167a |
12 | 2576356460b19 |
13 | c38a9ac5635a |
14 | 5616241215d3 |
15 | 282928e15a93 |
hex | 140553ab3c45 |
22013111123013 has 8 divisors (see below), whose sum is σ = 31077333350208. Its totient is φ = 13812148155584.
The previous prime is 22013111122997. The next prime is 22013111123023. The reversal of 22013111123013 is 31032111131022.
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 22013111123013 - 24 = 22013111122997 is a prime.
It is a super-2 number, since 2×220131111230132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013111123023) 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, 215814814881 + ... + 215814814982.
It is an arithmetic number, because the mean of its divisors is an integer number (3884666668776).
Almost surely, 222013111123013 is an apocalyptic number.
It is an amenable number.
22013111123013 is a deficient number, since it is larger than the sum of its proper divisors (9064222227195).
22013111123013 is a wasteful number, since it uses less digits than its factorization.
22013111123013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431629629883.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 22013111123013 its reverse (31032111131022), we get a palindrome (53045222254035).
The spelling of 22013111123013 in words is "twenty-two trillion, thirteen billion, one hundred eleven million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •