Base | Representation |
---|---|
bin | 1010000001001101110101… |
… | …10010101100000011100101 |
3 | 2220000020111102200100002101 |
4 | 11000212322302230003211 |
5 | 10341433034401023023 |
6 | 114505212030412101 |
7 | 4432522010334514 |
oct | 500467262540345 |
9 | 86006442610071 |
10 | 22032021111013 |
11 | 70248005a8531 |
12 | 2579b53361031 |
13 | c3a7c2869574 |
14 | 5624d974867b |
15 | 2831841201ad |
hex | 1409bacac0e5 |
22032021111013 has 8 divisors (see below), whose sum is σ = 22791980026080. Its totient is φ = 21272077799280.
The previous prime is 22032021110951. The next prime is 22032021111019. The reversal of 22032021111013 is 31011112023022.
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 22032021111013 - 225 = 22031987556581 is a prime.
It is a super-2 number, since 2×220320211110132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22032021111019) 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, 991323 + ... + 6711688.
It is an arithmetic number, because the mean of its divisors is an integer number (2848997503260).
Almost surely, 222032021111013 is an apocalyptic number.
It is an amenable number.
22032021111013 is a deficient number, since it is larger than the sum of its proper divisors (759958915067).
22032021111013 is an equidigital number, since it uses as much as digits as its factorization.
22032021111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7801667.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 22032021111013 its reverse (31011112023022), we get a palindrome (53043133134035).
The spelling of 22032021111013 in words is "twenty-two trillion, thirty-two billion, twenty-one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •