Base | Representation |
---|---|
bin | 1010000110011110111111… |
… | …11000110100010101011011 |
3 | 2220122112201101210101011110 |
4 | 11003033133320310111123 |
5 | 10402414242204214321 |
6 | 115124305344231403 |
7 | 4451560433351100 |
oct | 503173770642533 |
9 | 86575641711143 |
10 | 22213032101211 |
11 | 709454858a5a6 |
12 | 25a904b60b563 |
13 | c518aba98463 |
14 | 56b18b912aa7 |
15 | 287c2a47b176 |
hex | 1433dfe3455b |
22213032101211 has 48 divisors (see below), whose sum is σ = 34884269222400. Its totient is φ = 12534909835392.
The previous prime is 22213032101153. The next prime is 22213032101219. The reversal of 22213032101211 is 11210123031222.
It is not a de Polignac number, because 22213032101211 - 221 = 22213030004059 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (22213032101219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3392335 + ... + 7478903.
It is an arithmetic number, because the mean of its divisors is an integer number (726755608800).
Almost surely, 222213032101211 is an apocalyptic number.
22213032101211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22213032101211 is a deficient number, since it is larger than the sum of its proper divisors (12671237121189).
22213032101211 is a wasteful number, since it uses less digits than its factorization.
22213032101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4087048 (or 4087041 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 22213032101211 its reverse (11210123031222), we get a palindrome (33423155132433).
The spelling of 22213032101211 in words is "twenty-two trillion, two hundred thirteen billion, thirty-two million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •