Base | Representation |
---|---|
bin | 11001010010011110101110… |
… | …110111110111010100010001 |
3 | 112120210122010112020010021212 |
4 | 121102132232313313110101 |
5 | 104034221314133310001 |
6 | 1032314135024025505 |
7 | 32266313560403300 |
oct | 3122365667672421 |
9 | 476718115203255 |
10 | 111221112010001 |
11 | 32490677223934 |
12 | 10583491462295 |
13 | 4a0a14b75b176 |
14 | 1d671b82d8437 |
15 | ccd1b2ac37bb |
hex | 6527aedf7511 |
111221112010001 has 12 divisors (see below), whose sum is σ = 129531336996852. Its totient is φ = 95220620395488.
The previous prime is 111221112009961. The next prime is 111221112010067. The reversal of 111221112010001 is 100010211122111.
It can be written as a sum of positive squares in 2 ways, for example, as 19833706785025 + 91387405224976 = 4453505^2 + 9559676^2 .
It is a de Polignac number, because none of the positive numbers 2k-111221112010001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (111221112010081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1330449770 + ... + 1330533363.
It is an arithmetic number, because the mean of its divisors is an integer number (10794278083071).
Almost surely, 2111221112010001 is an apocalyptic number.
It is an amenable number.
111221112010001 is a deficient number, since it is larger than the sum of its proper divisors (18310224986851).
111221112010001 is an equidigital number, since it uses as much as digits as its factorization.
111221112010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2660984000 (or 2660983993 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111221112010001 its reverse (100010211122111), we get a palindrome (211231323132112).
The spelling of 111221112010001 in words is "one hundred eleven trillion, two hundred twenty-one billion, one hundred twelve million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •