Base | Representation |
---|---|
bin | 10110110000110100101010… |
… | …110100100000101101011010 |
3 | 111010110121212011011001112011 |
4 | 112300310222310200231122 |
5 | 101110214100421023002 |
6 | 552530511404540134 |
7 | 30041601303644254 |
oct | 2660645264405532 |
9 | 433417764131464 |
10 | 100112111111002 |
11 | 29998342894221 |
12 | b28a49355164a |
13 | 43b26bab21153 |
14 | 1aa1648534cd4 |
15 | b8922bdc68d7 |
hex | 5b0d2ad20b5a |
100112111111002 has 4 divisors (see below), whose sum is σ = 150168166666506. Its totient is φ = 50056055555500.
The previous prime is 100112111110849. The next prime is 100112111111063. The reversal of 100112111111002 is 200111111211001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 93926897344921 + 6185213766081 = 9691589^2 + 2487009^2 .
It is a super-2 number, since 2×1001121111110022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25028027777749 + ... + 25028027777752.
Almost surely, 2100112111111002 is an apocalyptic number.
100112111111002 is a deficient number, since it is larger than the sum of its proper divisors (50056055555504).
100112111111002 is an equidigital number, since it uses as much as digits as its factorization.
100112111111002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50056055555503.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 100112111111002 its reverse (200111111211001), we get a palindrome (300223222322003).
Subtracting 100112111111002 from its reverse (200111111211001), we obtain a palindrome (99999000099999).
The spelling of 100112111111002 in words is "one hundred trillion, one hundred twelve billion, one hundred eleven million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •