Base | Representation |
---|---|
bin | 110011010111100001… |
… | …1111000010001010000 |
3 | 101112201210000012010121 |
4 | 1212233003320101100 |
5 | 3301404132241422 |
6 | 122402024040024 |
7 | 10653420555253 |
oct | 1465703702120 |
9 | 345653005117 |
10 | 110311212112 |
11 | 42867892402 |
12 | 19467003014 |
13 | a52cb2219a |
14 | 54a667509a |
15 | 2d095bd8c7 |
hex | 19af0f8450 |
110311212112 has 10 divisors (see below), whose sum is σ = 213727973498. Its totient is φ = 55155606048.
The previous prime is 110311212091. The next prime is 110311212113. The reversal of 110311212112 is 211212113011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 104042373136 + 6268838976 = 322556^2 + 79176^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 6894450757 = 110311212112 / (1 + 1 + 0 + 3 + 1 + 1 + 2 + 1 + 2 + 1 + 1 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110311212113) 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 as a sum of consecutive naturals, namely, 3447225363 + ... + 3447225394.
Almost surely, 2110311212112 is an apocalyptic number.
It is an amenable number.
110311212112 is a deficient number, since it is larger than the sum of its proper divisors (103416761386).
110311212112 is an equidigital number, since it uses as much as digits as its factorization.
110311212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6894450765 (or 6894450759 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 110311212112 its reverse (211212113011), we get a palindrome (321523325123).
The spelling of 110311212112 in words is "one hundred ten billion, three hundred eleven million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •