Base | Representation |
---|---|
bin | 10000001010010001100… |
… | …110101100111010011001 |
3 | 10221011111202012222220201 |
4 | 100022101212230322121 |
5 | 121143343331412441 |
6 | 2210102124422201 |
7 | 143143216453345 |
oct | 20122146547231 |
9 | 3834452188821 |
10 | 1110544404121 |
11 | 398a85400969 |
12 | 15b2930a7961 |
13 | 809544c6b59 |
14 | 3ba71a60625 |
15 | 1dd4b548c31 |
hex | 102919ace99 |
1110544404121 has 8 divisors (see below), whose sum is σ = 1161835766784. Its totient is φ = 1060405656480.
The previous prime is 1110544404113. The next prime is 1110544404161. The reversal of 1110544404121 is 1214044450111.
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 1110544404121 - 23 = 1110544404113 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 1110544404121.
It is not an unprimeable number, because it can be changed into a prime (1110544404161) 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, 288151785 + ... + 288155638.
It is an arithmetic number, because the mean of its divisors is an integer number (145229470848).
Almost surely, 21110544404121 is an apocalyptic number.
It is an amenable number.
1110544404121 is a deficient number, since it is larger than the sum of its proper divisors (51291362663).
1110544404121 is an equidigital number, since it uses as much as digits as its factorization.
1110544404121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576307511.
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 1110544404121 its reverse (1214044450111), we get a palindrome (2324588854232).
The spelling of 1110544404121 in words is "one trillion, one hundred ten billion, five hundred forty-four million, four hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •