Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000010111010000011000001 |
3 | 112102211110101001212222112020 |
4 | 121002022220002322003001 |
5 | 103412334310304000001 |
6 | 1030055125150352053 |
7 | 32122314624141201 |
oct | 3102125002720301 |
9 | 472743331788466 |
10 | 110100011000001 |
11 | 320991749a9800 |
12 | 10422152abb629 |
13 | 4958504162979 |
14 | 1d28c24626401 |
15 | cade498c1736 |
hex | 6422a80ba0c1 |
110100011000001 has 24 divisors (see below), whose sum is σ = 165719739605952. Its totient is φ = 64923839402400.
The previous prime is 110100010999997. The next prime is 110100011000081. The reversal of 110100011000001 is 100000110001011.
It is not a de Polignac number, because 110100011000001 - 22 = 110100010999997 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110100011000081) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4098713805 + ... + 4098740666.
It is an arithmetic number, because the mean of its divisors is an integer number (6904989150248).
Almost surely, 2110100011000001 is an apocalyptic number.
110100011000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110100011000001 is a deficient number, since it is larger than the sum of its proper divisors (55619728605951).
110100011000001 is a wasteful number, since it uses less digits than its factorization.
110100011000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8197454533 (or 8197454522 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110100011000001 its reverse (100000110001011), we get a palindrome (210100121001012).
The spelling of 110100011000001 in words is "one hundred ten trillion, one hundred billion, eleven million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •