Base | Representation |
---|---|
bin | 110000001110100110110101… |
… | …110111101111011010110001 |
3 | 1000211000112000101012012220020 |
4 | 300032212311313233122301 |
5 | 210300202300331414301 |
6 | 2031041554405234053 |
7 | 62451304545162201 |
oct | 6016466567573261 |
9 | 1024015011165806 |
10 | 212110011201201 |
11 | 61648394698953 |
12 | 1b958411702929 |
13 | 9147b7159ab99 |
14 | 3a542720a0401 |
15 | 197c70506b436 |
hex | c0e9b5def6b1 |
212110011201201 has 8 divisors (see below), whose sum is σ = 282813415542720. Its totient is φ = 141406640496912.
The previous prime is 212110011201199. The next prime is 212110011201211. The reversal of 212110011201201 is 102102110011212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212110011201201 - 21 = 212110011201199 is a prime.
It is a super-2 number, since 2×2121100112012012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (212110011201211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20622820 + ... + 29146538.
It is an arithmetic number, because the mean of its divisors is an integer number (35351676942840).
Almost surely, 2212110011201201 is an apocalyptic number.
It is an amenable number.
212110011201201 is a deficient number, since it is larger than the sum of its proper divisors (70703404341519).
212110011201201 is an equidigital number, since it uses as much as digits as its factorization.
212110011201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16818615.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 212110011201201 its reverse (102102110011212), we get a palindrome (314212121212413).
The spelling of 212110011201201 in words is "two hundred twelve trillion, one hundred ten billion, eleven million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •