Base | Representation |
---|---|
bin | 110011001111001101… |
… | …1001100000110110001 |
3 | 101112000022211100000101 |
4 | 1212132123030012301 |
5 | 3300321210010001 |
6 | 122314213552401 |
7 | 10643461334422 |
oct | 1463633140661 |
9 | 345008740011 |
10 | 110032110001 |
11 | 42734291900 |
12 | 193a9645701 |
13 | a4b70603c8 |
14 | 547b581649 |
15 | 2cded3ba01 |
hex | 199e6cc1b1 |
110032110001 has 24 divisors (see below), whose sum is σ = 123411657600. Its totient is φ = 98007967200.
The previous prime is 110032109947. The next prime is 110032110011. The reversal of 110032110001 is 100011230011.
It is not a de Polignac number, because 110032110001 - 217 = 110031978929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110032110001.
It is not an unprimeable number, because it can be changed into a prime (110032110011) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 1208295 + ... + 1296163.
It is an arithmetic number, because the mean of its divisors is an integer number (5142152400).
Almost surely, 2110032110001 is an apocalyptic number.
110032110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110032110001 is a deficient number, since it is larger than the sum of its proper divisors (13379547599).
110032110001 is a wasteful number, since it uses less digits than its factorization.
110032110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88101 (or 88090 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 110032110001 its reverse (100011230011), we get a palindrome (210043340012).
The spelling of 110032110001 in words is "one hundred ten billion, thirty-two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •