Base | Representation |
---|---|
bin | 10100100110000011… |
… | …001010011110001101 |
3 | 2010002002212221200220 |
4 | 110212003022132031 |
5 | 330241434400023 |
6 | 14054134341553 |
7 | 1411662045612 |
oct | 244603123615 |
9 | 63062787626 |
10 | 22113200013 |
11 | 9418363513 |
12 | 43517ba8b9 |
13 | 2115437a48 |
14 | 10dac0a509 |
15 | 89653e3e3 |
hex | 5260ca78d |
22113200013 has 4 divisors (see below), whose sum is σ = 29484266688. Its totient is φ = 14742133340.
The previous prime is 22113200009. The next prime is 22113200069. The reversal of 22113200013 is 31000231122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22113200013 - 22 = 22113200009 is a prime.
It is a super-2 number, since 2×221132000132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22113199965 and 22113200001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22113200113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3685533333 + ... + 3685533338.
It is an arithmetic number, because the mean of its divisors is an integer number (7371066672).
Almost surely, 222113200013 is an apocalyptic number.
It is an amenable number.
22113200013 is a deficient number, since it is larger than the sum of its proper divisors (7371066675).
22113200013 is an equidigital number, since it uses as much as digits as its factorization.
22113200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7371066674.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 22113200013 its reverse (31000231122), we get a palindrome (53113431135).
The spelling of 22113200013 in words is "twenty-two billion, one hundred thirteen million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •