Base | Representation |
---|---|
bin | 11001010010001100000111… |
… | …011000110101100010100001 |
3 | 112120201201112101220011112222 |
4 | 121102030013120311202201 |
5 | 104033404344241241001 |
6 | 1032301031301200425 |
7 | 32265005321046653 |
oct | 3122140730654241 |
9 | 476651471804488 |
10 | 111201122212001 |
11 | 32483149532818 |
12 | 1057b632a00115 |
13 | 4a082b4216023 |
14 | 1d6623d50a6d3 |
15 | ccc8e2bc061b |
hex | 6523076358a1 |
111201122212001 has 4 divisors (see below), whose sum is σ = 111201936943104. Its totient is φ = 111200307480900.
The previous prime is 111201122211979. The next prime is 111201122212007. The reversal of 111201122212001 is 100212221102111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111201122212001 - 234 = 111183942342817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111201122212007) 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, 407160785 + ... + 407433806.
It is an arithmetic number, because the mean of its divisors is an integer number (27800484235776).
Almost surely, 2111201122212001 is an apocalyptic number.
It is an amenable number.
111201122212001 is a deficient number, since it is larger than the sum of its proper divisors (814731103).
111201122212001 is an equidigital number, since it uses as much as digits as its factorization.
111201122212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 814731102.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111201122212001 its reverse (100212221102111), we get a palindrome (211413343314112).
The spelling of 111201122212001 in words is "one hundred eleven trillion, two hundred one billion, one hundred twenty-two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •