Base | Representation |
---|---|
bin | 1011000110001100101101… |
… | …1111011000011101001010 |
3 | 1121012102020002221200201102 |
4 | 2301203023133120131022 |
5 | 3044400344001401442 |
6 | 41541041225421402 |
7 | 2366334104234102 |
oct | 261431337303512 |
9 | 47172202850642 |
10 | 12201121122122 |
11 | 3984514877709 |
12 | 14507aa93a862 |
13 | 6a673a07681a |
14 | 30277493a202 |
15 | 1625a49ee232 |
hex | b18cb7d874a |
12201121122122 has 16 divisors (see below), whose sum is σ = 18421254661992. Its totient is φ = 6060770516160.
The previous prime is 12201121122121. The next prime is 12201121122143. The reversal of 12201121122122 is 22122112110221.
It can be written as a sum of positive squares in 4 ways, for example, as 10381290444001 + 1819830678121 = 3222001^2 + 1349011^2 .
It is a super-2 number, since 2×122011211221222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12201121122094 and 12201121122103.
It is not an unprimeable number, because it can be changed into a prime (12201121122121) 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 7 ways as a sum of consecutive naturals, for example, 16542173 + ... + 17264000.
Almost surely, 212201121122122 is an apocalyptic number.
12201121122122 is a deficient number, since it is larger than the sum of its proper divisors (6220133539870).
12201121122122 is a wasteful number, since it uses less digits than its factorization.
12201121122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33807353.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 12201121122122 its reverse (22122112110221), we get a palindrome (34323233232343).
The spelling of 12201121122122 in words is "twelve trillion, two hundred one billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •