Base | Representation |
---|---|
bin | 1011000110101101110011… |
… | …1001111001101000011110 |
3 | 1121020021011010012001211100 |
4 | 2301223130321321220132 |
5 | 3100022041311033042 |
6 | 41545110435533530 |
7 | 2400100155645135 |
oct | 261533471715036 |
9 | 47207133161740 |
10 | 12210003221022 |
11 | 3988262560012 |
12 | 145246945a2a6 |
13 | 6a7524286349 |
14 | 302d7842091c |
15 | 16292468c24c |
hex | b1adce79a1e |
12210003221022 has 24 divisors (see below), whose sum is σ = 26461398782520. Its totient is φ = 4069017719280.
The previous prime is 12210003221011. The next prime is 12210003221093. The reversal of 12210003221022 is 22012230001221.
It is a super-2 number, since 2×122100032210222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12210003220986 and 12210003221004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 81869629 + ... + 82018632.
It is an arithmetic number, because the mean of its divisors is an integer number (1102558282605).
Almost surely, 212210003221022 is an apocalyptic number.
12210003221022 is an abundant number, since it is smaller than the sum of its proper divisors (14251395561498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210003221022 is a wasteful number, since it uses less digits than its factorization.
12210003221022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163892408 (or 163892405 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 12210003221022 its reverse (22012230001221), we get a palindrome (34222233222243).
The spelling of 12210003221022 in words is "twelve trillion, two hundred ten billion, three million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •