Base | Representation |
---|---|
bin | 11001010010001100000001… |
… | …010110110010100000100010 |
3 | 112120201201021100110200020212 |
4 | 121102030001112302200202 |
5 | 104033404142334341002 |
6 | 1032301013244134122 |
7 | 32265002651626145 |
oct | 3122140126624042 |
9 | 476651240420225 |
10 | 111201021012002 |
11 | 324830a73a1759 |
12 | 1057b604b37342 |
13 | 4a0829927227c |
14 | 1d6622dcc605c |
15 | ccc8d8d80352 |
hex | 6523015b2822 |
111201021012002 has 16 divisors (see below), whose sum is σ = 168818469775200. Its totient is φ = 54928255541472.
The previous prime is 111201021011957. The next prime is 111201021012007. The reversal of 111201021012002 is 200210120102111.
It is a super-2 number, since 2×1112010210120022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111201021012007) 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 7 ways as a sum of consecutive naturals, for example, 10583627 + ... + 18287022.
It is an arithmetic number, because the mean of its divisors is an integer number (10551154360950).
Almost surely, 2111201021012002 is an apocalyptic number.
111201021012002 is a deficient number, since it is larger than the sum of its proper divisors (57617448763198).
111201021012002 is a wasteful number, since it uses less digits than its factorization.
111201021012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28893937.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111201021012002 its reverse (200210120102111), we get a palindrome (311411141114113).
The spelling of 111201021012002 in words is "one hundred eleven trillion, two hundred one billion, twenty-one million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •