Base | Representation |
---|---|
bin | 110011011010010010… |
… | …1111000101100000001 |
3 | 101112222020121221202011 |
4 | 1212310211320230001 |
5 | 3302101411402201 |
6 | 122415141052521 |
7 | 10655625424225 |
oct | 1466445705401 |
9 | 345866557664 |
10 | 110404012801 |
11 | 42905206995 |
12 | 194920b7141 |
13 | a546114b34 |
14 | 54b4b10785 |
15 | 2d12800151 |
hex | 19b4978b01 |
110404012801 has 8 divisors (see below), whose sum is σ = 111965802120. Its totient is φ = 108843558912.
The previous prime is 110404012753. The next prime is 110404012811. The reversal of 110404012801 is 108210404011.
It can be written as a sum of positive squares in 4 ways, for example, as 14056473600 + 96347539201 = 118560^2 + 310399^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110404012801 - 27 = 110404012673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110404012811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166756 + ... + 498613.
It is an arithmetic number, because the mean of its divisors is an integer number (13995725265).
Almost surely, 2110404012801 is an apocalyptic number.
It is an amenable number.
110404012801 is a deficient number, since it is larger than the sum of its proper divisors (1561789319).
110404012801 is an equidigital number, since it uses as much as digits as its factorization.
110404012801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667715.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 110404012801 its reverse (108210404011), we get a palindrome (218614416812).
The spelling of 110404012801 in words is "one hundred ten billion, four hundred four million, twelve thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •