Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0111110010100111001 |
3 | 101112012001222020000122 |
4 | 1212202132332110321 |
5 | 3300441123223001 |
6 | 122325045343025 |
7 | 10645246231544 |
oct | 1464236762471 |
9 | 345161866018 |
10 | 110100211001 |
11 | 42769776120 |
12 | 19408407a75 |
13 | a4c81b5761 |
14 | 548662b85b |
15 | 2ce5cdeb1b |
hex | 19a27be539 |
110100211001 has 8 divisors (see below), whose sum is σ = 120249156000. Its totient is φ = 99974571840.
The previous prime is 110100210973. The next prime is 110100211019. The reversal of 110100211001 is 100112001011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110100211001 - 210 = 110100209977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110100211001.
It is not an unprimeable number, because it can be changed into a prime (110100211301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5816576 + ... + 5835473.
It is an arithmetic number, because the mean of its divisors is an integer number (15031144500).
Almost surely, 2110100211001 is an apocalyptic number.
110100211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110100211001 is a deficient number, since it is larger than the sum of its proper divisors (10148944999).
110100211001 is a wasteful number, since it uses less digits than its factorization.
110100211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11652919.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110100211001 its reverse (100112001011), we get a palindrome (210212212012).
The spelling of 110100211001 in words is "one hundred ten billion, one hundred million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •