Base | Representation |
---|---|
bin | 1010000000101010100111… |
… | …01111011101011001110010 |
3 | 2212221102200122111100111221 |
4 | 11000111103233131121302 |
5 | 10341130323224422010 |
6 | 114452403442055254 |
7 | 4431252305422450 |
oct | 500252357353162 |
9 | 85842618440457 |
10 | 22013112342130 |
11 | 7017788044608 |
12 | 257635694a52a |
13 | c38a9b292220 |
14 | 56162435b9d0 |
15 | 2829290a6dda |
hex | 140553bdd672 |
22013112342130 has 128 divisors (see below), whose sum is σ = 48861953118720. Its totient is φ = 6953308876800.
The previous prime is 22013112342119. The next prime is 22013112342161. The reversal of 22013112342130 is 3124321131022.
It is a super-2 number, since 2×220131123421302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22013112342095 and 22013112342104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1034975136 + ... + 1034996404.
It is an arithmetic number, because the mean of its divisors is an integer number (381734008740).
Almost surely, 222013112342130 is an apocalyptic number.
22013112342130 is an abundant number, since it is smaller than the sum of its proper divisors (26848840776590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22013112342130 is a wasteful number, since it uses less digits than its factorization.
22013112342130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23444.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 22013112342130 its reverse (3124321131022), we get a palindrome (25137433473152).
The spelling of 22013112342130 in words is "twenty-two trillion, thirteen billion, one hundred twelve million, three hundred forty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.265 sec. • engine limits •