Base | Representation |
---|---|
bin | 1011000110110010010110… |
… | …0011010000011111011110 |
3 | 1121020101022001120120121101 |
4 | 2301230211203100133132 |
5 | 3100032040314201420 |
6 | 41545431415023314 |
7 | 2400142315410106 |
oct | 261544543203736 |
9 | 47211261516541 |
10 | 12211222022110 |
11 | 3988828538341 |
12 | 145274966ab3a |
13 | 6a7689931317 |
14 | 303052246206 |
15 | 16299668d60a |
hex | b1b258d07de |
12211222022110 has 32 divisors (see below), whose sum is σ = 22704436276992. Its totient is φ = 4723758416640.
The previous prime is 12211222022093. The next prime is 12211222022117. The reversal of 12211222022110 is 1122022211221.
It is a super-2 number, since 2×122112220221102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211222022117) 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, 12729079 + ... + 13654738.
It is an arithmetic number, because the mean of its divisors is an integer number (709513633656).
Almost surely, 212211222022110 is an apocalyptic number.
12211222022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12211222022110 is a deficient number, since it is larger than the sum of its proper divisors (10493214254882).
12211222022110 is a wasteful number, since it uses less digits than its factorization.
12211222022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26385348.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12211222022110 its reverse (1122022211221), we get a palindrome (13333244233331).
The spelling of 12211222022110 in words is "twelve trillion, two hundred eleven billion, two hundred twenty-two million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •