Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0001111101100100010 |
3 | 101112012001121112000121 |
4 | 1212202132033230202 |
5 | 3300441101120002 |
6 | 122325041310454 |
7 | 10645244504650 |
oct | 1464236175442 |
9 | 345161545017 |
10 | 110100020002 |
11 | 42769655675 |
12 | 1940833542a |
13 | a4c814983b |
14 | 54865bbdd0 |
15 | 2ce5ca3237 |
hex | 19a278fb22 |
110100020002 has 8 divisors (see below), whose sum is σ = 188742891456. Its totient is φ = 47185722852.
The previous prime is 110100019973. The next prime is 110100020059. The reversal of 110100020002 is 200020001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (7).
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, 3932143558 + ... + 3932143585.
It is an arithmetic number, because the mean of its divisors is an integer number (23592861432).
Almost surely, 2110100020002 is an apocalyptic number.
110100020002 is a deficient number, since it is larger than the sum of its proper divisors (78642871454).
110100020002 is an equidigital number, since it uses as much as digits as its factorization.
110100020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7864287152.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 110100020002 its reverse (200020001011), we get a palindrome (310120021013).
The spelling of 110100020002 in words is "one hundred ten billion, one hundred million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •