Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …0100101011100001101010 |
3 | 1120220212021200222121020101 |
4 | 2300121212010223201222 |
5 | 3042102040203242302 |
6 | 41440453123420014 |
7 | 2360536122464044 |
oct | 260314604534152 |
9 | 46825250877211 |
10 | 12122110212202 |
11 | 3953a5a212651 |
12 | 143941a22460a |
13 | 69c157b2c113 |
14 | 2dc9db2aca94 |
15 | 1604cd2a9287 |
hex | b066612b86a |
12122110212202 has 8 divisors (see below), whose sum is σ = 18225158772996. Its totient is φ = 6047057287872.
The previous prime is 12122110212143. The next prime is 12122110212203. The reversal of 12122110212202 is 20221201122121.
It can be written as a sum of positive squares in 2 ways, for example, as 9782375927041 + 2339734285161 = 3127679^2 + 1529619^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12122110212202.
It is not an unprimeable number, because it can be changed into a prime (12122110212203) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 6998908033 + ... + 6998909764.
Almost surely, 212122110212202 is an apocalyptic number.
12122110212202 is a deficient number, since it is larger than the sum of its proper divisors (6103048560794).
12122110212202 is a wasteful number, since it uses less digits than its factorization.
12122110212202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13997818232.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12122110212202 its reverse (20221201122121), we get a palindrome (32343311334323).
The spelling of 12122110212202 in words is "twelve trillion, one hundred twenty-two billion, one hundred ten million, two hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •