Base | Representation |
---|---|
bin | 10000001010001011100… |
… | …001010100111111101101 |
3 | 10221011020122011012111000 |
4 | 100022023201110333231 |
5 | 121143141214112031 |
6 | 2210044040550513 |
7 | 143140540041402 |
oct | 20121341247755 |
9 | 3834218135430 |
10 | 1110442332141 |
11 | 398a3282475a |
12 | 15b264a82439 |
13 | 8093930922c |
14 | 3ba622902a9 |
15 | 1dd425d53e6 |
hex | 1028b854fed |
1110442332141 has 16 divisors (see below), whose sum is σ = 1645208781120. Its totient is φ = 740245824720.
The previous prime is 1110442332133. The next prime is 1110442332203. The reversal of 1110442332141 is 1412332440111.
It is a happy number.
1110442332141 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 442 + 3 + 3 + 214 + 1 = 666.
It is not a de Polignac number, because 1110442332141 - 23 = 1110442332133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110442332541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 945615 + ... + 1764956.
It is an arithmetic number, because the mean of its divisors is an integer number (102825548820).
Almost surely, 21110442332141 is an apocalyptic number.
It is an amenable number.
1110442332141 is a deficient number, since it is larger than the sum of its proper divisors (534766448979).
1110442332141 is a wasteful number, since it uses less digits than its factorization.
1110442332141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2725753 (or 2725747 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 1110442332141 its reverse (1412332440111), we get a palindrome (2522774772252).
The spelling of 1110442332141 in words is "one trillion, one hundred ten billion, four hundred forty-two million, three hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •