Base | Representation |
---|---|
bin | 1011000001100110000000… |
… | …1010001110000100100001 |
3 | 1120220212000210022011012220 |
4 | 2300121200022032010201 |
5 | 3042101334304013441 |
6 | 41440435221141253 |
7 | 2360533506265650 |
oct | 260314012160441 |
9 | 46825023264186 |
10 | 12122011001121 |
11 | 3953a0920a91a |
12 | 14393b0b5a829 |
13 | 69c140403738 |
14 | 2dc9cc045197 |
15 | 1604c470d466 |
hex | b066028e121 |
12122011001121 has 64 divisors (see below), whose sum is σ = 19200768491520. Its totient is φ = 6655763600640.
The previous prime is 12122011001071. The next prime is 12122011001131. The reversal of 12122011001121 is 12110011022121.
It is a happy number.
It is not a de Polignac number, because 12122011001121 - 211 = 12122010999073 is a prime.
It is a super-2 number, since 2×121220110011212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12122011001121.
It is not an unprimeable number, because it can be changed into a prime (12122011001131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 451273231 + ... + 451300091.
It is an arithmetic number, because the mean of its divisors is an integer number (300012007680).
Almost surely, 212122011001121 is an apocalyptic number.
It is an amenable number.
12122011001121 is a deficient number, since it is larger than the sum of its proper divisors (7078757490399).
12122011001121 is a wasteful number, since it uses less digits than its factorization.
12122011001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30446.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12122011001121 its reverse (12110011022121), we get a palindrome (24232022023242).
The spelling of 12122011001121 in words is "twelve trillion, one hundred twenty-two billion, eleven million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •