Base | Representation |
---|---|
bin | 110011011010011110… |
… | …0110110011111111001 |
3 | 101112222122221211002212 |
4 | 1212310330312133321 |
5 | 3302104432030040 |
6 | 122415514104505 |
7 | 10656030540236 |
oct | 1466474663771 |
9 | 345878854085 |
10 | 110410033145 |
11 | 42908649085 |
12 | 1949411b135 |
13 | a547442179 |
14 | 54b583a78d |
15 | 2d130ddd65 |
hex | 19b4f367f9 |
110410033145 has 8 divisors (see below), whose sum is σ = 133803842760. Its totient is φ = 87453491200.
The previous prime is 110410033121. The next prime is 110410033147. The reversal of 110410033145 is 541330014011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 12355878649 + 98054154496 = 111157^2 + 313136^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110410033145 - 26 = 110410033081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110410033145.
It is not an unprimeable number, because it can be changed into a prime (110410033147) 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, 109316360 + ... + 109317369.
It is an arithmetic number, because the mean of its divisors is an integer number (16725480345).
Almost surely, 2110410033145 is an apocalyptic number.
It is an amenable number.
110410033145 is a deficient number, since it is larger than the sum of its proper divisors (23393809615).
110410033145 is a wasteful number, since it uses less digits than its factorization.
110410033145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218633835.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 110410033145 its reverse (541330014011), we get a palindrome (651740047156).
The spelling of 110410033145 in words is "one hundred ten billion, four hundred ten million, thirty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •