Base | Representation |
---|---|
bin | 1011000110001000111100… |
… | …1110010000111101100110 |
3 | 1121012022121122100110200211 |
4 | 2301202033032100331212 |
5 | 3044341311130031042 |
6 | 41540353025530034 |
7 | 2366300045660065 |
oct | 261421716207546 |
9 | 47168548313624 |
10 | 12200110002022 |
11 | 3984046049168 |
12 | 14505681a391a |
13 | 6a6608744cc7 |
14 | 3026ba5361dc |
15 | 162545d73017 |
hex | b188f390f66 |
12200110002022 has 32 divisors (see below), whose sum is σ = 19632141043200. Its totient is φ = 5668779761568.
The previous prime is 12200110002011. The next prime is 12200110002029. The reversal of 12200110002022 is 22020001100221.
It is a happy number.
12200110002022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×122001100020222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12200110001993 and 12200110002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200110002029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4838433 + ... + 6914524.
It is an arithmetic number, because the mean of its divisors is an integer number (613504407600).
Almost surely, 212200110002022 is an apocalyptic number.
12200110002022 is a deficient number, since it is larger than the sum of its proper divisors (7432031041178).
12200110002022 is a wasteful number, since it uses less digits than its factorization.
12200110002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11753500.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12200110002022 its reverse (22020001100221), we get a palindrome (34220111102243).
The spelling of 12200110002022 in words is "twelve trillion, two hundred billion, one hundred ten million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •