Base | Representation |
---|---|
bin | 110011011011101011… |
… | …0100000110100111000 |
3 | 101120002110202022210211 |
4 | 1212313112200310320 |
5 | 3302200240031202 |
6 | 122423513320504 |
7 | 10660030116604 |
oct | 1466726406470 |
9 | 346073668724 |
10 | 110450314552 |
11 | 429293610a6 |
12 | 194a5706134 |
13 | a5528a6b16 |
14 | 54bad24504 |
15 | 2d168e91d7 |
hex | 19b75a0d38 |
110450314552 has 8 divisors (see below), whose sum is σ = 207094339800. Its totient is φ = 55225157272.
The previous prime is 110450314537. The next prime is 110450314567. The reversal of 110450314552 is 255413054011.
110450314552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (110450314537) and next prime (110450314567).
It is a tau number, because it is divible by the number of its divisors (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6903144652 + ... + 6903144667.
It is an arithmetic number, because the mean of its divisors is an integer number (25886792475).
Almost surely, 2110450314552 is an apocalyptic number.
It is an amenable number.
110450314552 is a deficient number, since it is larger than the sum of its proper divisors (96644025248).
110450314552 is a wasteful number, since it uses less digits than its factorization.
110450314552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13806289325 (or 13806289321 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 110450314552 its reverse (255413054011), we get a palindrome (365863368563).
The spelling of 110450314552 in words is "one hundred ten billion, four hundred fifty million, three hundred fourteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •