Base | Representation |
---|---|
bin | 11001010000101110001000… |
… | …101011000000001100100010 |
3 | 112120101002001210120021121111 |
4 | 121100232020223000030202 |
5 | 104030231213234120002 |
6 | 1032142422141413534 |
7 | 32254503552423322 |
oct | 3120561053001442 |
9 | 476332053507544 |
10 | 111100212020002 |
11 | 32444376343a27 |
12 | 10563b7026a2aa |
13 | 49cb921c81b4a |
14 | 1d613c9639282 |
15 | cc9e88ae43d7 |
hex | 650b88ac0322 |
111100212020002 has 8 divisors (see below), whose sum is σ = 166674579270300. Its totient is φ = 55542018929904.
The previous prime is 111100212019991. The next prime is 111100212020009. The reversal of 111100212020002 is 200020212001111.
It can be written as a sum of positive squares in 2 ways, for example, as 102052202163921 + 9048009856081 = 10102089^2 + 3007991^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1111002120200022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111100212020009) 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 3 ways as a sum of consecutive naturals, for example, 4043522877 + ... + 4043550352.
Almost surely, 2111100212020002 is an apocalyptic number.
111100212020002 is a deficient number, since it is larger than the sum of its proper divisors (55574367250298).
111100212020002 is an equidigital number, since it uses as much as digits as its factorization.
111100212020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8087080100.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111100212020002 its reverse (200020212001111), we get a palindrome (311120424021113).
The spelling of 111100212020002 in words is "one hundred eleven trillion, one hundred billion, two hundred twelve million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •