Base | Representation |
---|---|
bin | 110000001111111011101011… |
… | …110010011101110010000010 |
3 | 1000211100020011012211211022122 |
4 | 300033323223302131302002 |
5 | 210303200333141213442 |
6 | 2031151502203004242 |
7 | 62461011220100462 |
oct | 6017735362356202 |
9 | 1024306135754278 |
10 | 212201110101122 |
11 | 61682a9264279a |
12 | 1b971bb6509682 |
13 | 915362bc771ac |
14 | 3a58834cd1ba2 |
15 | 197ec87b12dd2 |
hex | c0feebc9dc82 |
212201110101122 has 8 divisors (see below), whose sum is σ = 320807977476096. Its totient is φ = 105265117609092.
The previous prime is 212201110101121. The next prime is 212201110101179. The reversal of 212201110101122 is 221101011102212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2122011101011222 (a number of 29 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 212201110101122.
It is not an unprimeable number, because it can be changed into a prime (212201110101121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417718720418 + ... + 417718720925.
It is an arithmetic number, because the mean of its divisors is an integer number (40100997184512).
Almost surely, 2212201110101122 is an apocalyptic number.
212201110101122 is a deficient number, since it is larger than the sum of its proper divisors (108606867374974).
212201110101122 is a wasteful number, since it uses less digits than its factorization.
212201110101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835437441472.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212201110101122 its reverse (221101011102212), we get a palindrome (433302121203334).
The spelling of 212201110101122 in words is "two hundred twelve trillion, two hundred one billion, one hundred ten million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •