Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …0000101001110111101110 |
3 | 1121020120200120200002010110 |
4 | 2301232202000221313232 |
5 | 3100100324341244042 |
6 | 41550414525520450 |
7 | 2400245131662420 |
oct | 261564200516756 |
9 | 47216616602113 |
10 | 12213310103022 |
11 | 39896aa175446 |
12 | 1453030a13126 |
13 | 6a7930407c62 |
14 | 3031ad6ac810 |
15 | 162a69b4e09c |
hex | b1ba2029dee |
12213310103022 has 32 divisors (see below), whose sum is σ = 27938963446272. Its totient is φ = 3486663913824.
The previous prime is 12213310102979. The next prime is 12213310103041. The reversal of 12213310103022 is 22030101331221.
12213310103022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 12213310103022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118833793 + ... + 118936524.
It is an arithmetic number, because the mean of its divisors is an integer number (873092607696).
Almost surely, 212213310103022 is an apocalyptic number.
12213310103022 is an abundant number, since it is smaller than the sum of its proper divisors (15725653343250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12213310103022 is a wasteful number, since it uses less digits than its factorization.
12213310103022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237771552.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12213310103022 its reverse (22030101331221), we get a palindrome (34243411434243).
The spelling of 12213310103022 in words is "twelve trillion, two hundred thirteen billion, three hundred ten million, one hundred three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •