Base | Representation |
---|---|
bin | 1011000110001001010010… |
… | …0110010110001110100010 |
3 | 1121012022211221002001121020 |
4 | 2301202110212112032202 |
5 | 3044342002222413442 |
6 | 41540410011110310 |
7 | 2366302222442163 |
oct | 261422446261642 |
9 | 47168757061536 |
10 | 12200200201122 |
11 | 3984091a5607a |
12 | 1450592442396 |
13 | 6a662133675b |
14 | 3026c84d576a |
15 | 16254dc3d9ec |
hex | b18949963a2 |
12200200201122 has 16 divisors (see below), whose sum is σ = 24561992459712. Its totient is φ = 4039801390800.
The previous prime is 12200200201087. The next prime is 12200200201157. The reversal of 12200200201122 is 22110200200221.
It is an interprime number because it is at equal distance from previous prime (12200200201087) and next prime (12200200201157).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6733001413 + ... + 6733003224.
It is an arithmetic number, because the mean of its divisors is an integer number (1535124528732).
Almost surely, 212200200201122 is an apocalyptic number.
12200200201122 is an abundant number, since it is smaller than the sum of its proper divisors (12361792258590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200200201122 is a wasteful number, since it uses less digits than its factorization.
12200200201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13466004793.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12200200201122 its reverse (22110200200221), we get a palindrome (34310400401343).
Subtracting 12200200201122 from its reverse (22110200200221), we obtain a palindrome (9909999999099).
The spelling of 12200200201122 in words is "twelve trillion, two hundred billion, two hundred million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •