Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001011101000000101001010 |
3 | 112102211200001101202200201111 |
4 | 121002030223023220011022 |
5 | 103412403312020213002 |
6 | 1030100131342240534 |
7 | 32122423300530631 |
oct | 3102145313500512 |
9 | 472750041680644 |
10 | 110102211101002 |
11 | 3209a0a389819a |
12 | 1042266788614a |
13 | 4958794bcb293 |
14 | 1d28d928cc518 |
15 | cae027b0d3d7 |
hex | 64232b2e814a |
110102211101002 has 8 divisors (see below), whose sum is σ = 165838600123812. Its totient is φ = 54822677726400.
The previous prime is 110102211100969. The next prime is 110102211101027. The reversal of 110102211101002 is 200101112201011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 104034063684681 + 6068147416321 = 10199709^2 + 2463361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114213911449 + ... + 114213912412.
Almost surely, 2110102211101002 is an apocalyptic number.
110102211101002 is a deficient number, since it is larger than the sum of its proper divisors (55736389022810).
110102211101002 is a wasteful number, since it uses less digits than its factorization.
110102211101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228427824104.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110102211101002 its reverse (200101112201011), we get a palindrome (310203323302013).
The spelling of 110102211101002 in words is "one hundred ten trillion, one hundred two billion, two hundred eleven million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •