Base | Representation |
---|---|
bin | 10000010101000011000… |
… | …010100001111110110001 |
3 | 10222021100212012011120120 |
4 | 100111003002201332301 |
5 | 121341040431414301 |
6 | 2215254001200453 |
7 | 144032650556664 |
oct | 20250302417661 |
9 | 3867325164516 |
10 | 1122111201201 |
11 | 3a29805797a1 |
12 | 161580930129 |
13 | 81a78993293 |
14 | 3c44bd136db |
15 | 1e2c6c47e36 |
hex | 105430a1fb1 |
1122111201201 has 16 divisors (see below), whose sum is σ = 1497926001600. Its totient is φ = 747185451008.
The previous prime is 1122111201181. The next prime is 1122111201217. The reversal of 1122111201201 is 1021021112211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1122111201201 - 222 = 1122107006897 is a prime.
It is a super-2 number, since 2×11221112012012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1122111201251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34394785 + ... + 34427393.
It is an arithmetic number, because the mean of its divisors is an integer number (93620375100).
Almost surely, 21122111201201 is an apocalyptic number.
It is an amenable number.
1122111201201 is a deficient number, since it is larger than the sum of its proper divisors (375814800399).
1122111201201 is a wasteful number, since it uses less digits than its factorization.
1122111201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45888.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1122111201201 its reverse (1021021112211), we get a palindrome (2143132313412).
The spelling of 1122111201201 in words is "one trillion, one hundred twenty-two billion, one hundred eleven million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •