Base | Representation |
---|---|
bin | 1010000011100011001111… |
… | …00111010111000110110001 |
3 | 2220021220112022212122102111 |
4 | 11001301213213113012301 |
5 | 10344241321340330223 |
6 | 115010115045445321 |
7 | 4441361446623061 |
oct | 501614747270661 |
9 | 86256468778374 |
10 | 22112230011313 |
11 | 7055820416492 |
12 | 25915b9110841 |
13 | c45236053810 |
14 | 5663481413a1 |
15 | 2852cab0530d |
hex | 141c679d71b1 |
22112230011313 has 16 divisors (see below), whose sum is σ = 23877086688000. Its totient is φ = 20356527991680.
The previous prime is 22112230011301. The next prime is 22112230011329. The reversal of 22112230011313 is 31311003221122.
It is a cyclic number.
It is not a de Polignac number, because 22112230011313 - 225 = 22112196456881 is a prime.
It is a super-2 number, since 2×221122300113132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22112230017313) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 21896088 + ... + 22883686.
It is an arithmetic number, because the mean of its divisors is an integer number (1492317918000).
Almost surely, 222112230011313 is an apocalyptic number.
It is an amenable number.
22112230011313 is a deficient number, since it is larger than the sum of its proper divisors (1764856676687).
22112230011313 is a wasteful number, since it uses less digits than its factorization.
22112230011313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992232.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 22112230011313 its reverse (31311003221122), we get a palindrome (53423233232435).
The spelling of 22112230011313 in words is "twenty-two trillion, one hundred twelve billion, two hundred thirty million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •