Base | Representation |
---|---|
bin | 10100110111110011… |
… | …001100110100011101 |
3 | 2010211212021000122010 |
4 | 110313303030310131 |
5 | 331344204131323 |
6 | 14143453341433 |
7 | 1422236254422 |
oct | 246763146435 |
9 | 63755230563 |
10 | 22411005213 |
11 | 9560478a13 |
12 | 4415497879 |
13 | 216204783c |
14 | 11285abd49 |
15 | 8b2767c93 |
hex | 537cccd1d |
22411005213 has 32 divisors (see below), whose sum is σ = 31595526144. Its totient is φ = 14101305152.
The previous prime is 22411005193. The next prime is 22411005217. The reversal of 22411005213 is 31250011422.
It is a de Polignac number, because none of the positive numbers 2k-22411005213 is a prime.
It is a super-2 number, since 2×224110052132 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 22411005213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22411005217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5799520 + ... + 5803382.
It is an arithmetic number, because the mean of its divisors is an integer number (987360192).
Almost surely, 222411005213 is an apocalyptic number.
22411005213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
22411005213 is a deficient number, since it is larger than the sum of its proper divisors (9184520931).
22411005213 is a wasteful number, since it uses less digits than its factorization.
22411005213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4985.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 22411005213 its reverse (31250011422), we get a palindrome (53661016635).
The spelling of 22411005213 in words is "twenty-two billion, four hundred eleven million, five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •