Base | Representation |
---|---|
bin | 110011010010100001… |
… | …1110110001101011001 |
3 | 101112022002022001102100 |
4 | 1212211003312031121 |
5 | 3301033204302023 |
6 | 122333231554013 |
7 | 10646312502063 |
oct | 1464503661531 |
9 | 345262261370 |
10 | 110143431513 |
11 | 42791106355 |
12 | 1941a98b909 |
13 | a50413911b |
14 | 548c27c733 |
15 | 2ce99cac43 |
hex | 19a50f6359 |
110143431513 has 12 divisors (see below), whose sum is σ = 159099136560. Its totient is φ = 73427537976.
The previous prime is 110143431479. The next prime is 110143431539. The reversal of 110143431513 is 315134341011.
110143431513 is a `hidden beast` number, since 1 + 1 + 0 + 143 + 4 + 3 + 1 + 513 = 666.
It is not a de Polignac number, because 110143431513 - 222 = 110139237209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110143431313) by changing a digit.
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 in 11 ways as a sum of consecutive naturals, for example, 612358 + ... + 771536.
It is an arithmetic number, because the mean of its divisors is an integer number (13258261380).
Almost surely, 2110143431513 is an apocalyptic number.
It is an amenable number.
110143431513 is a deficient number, since it is larger than the sum of its proper divisors (48955705047).
110143431513 is a wasteful number, since it uses less digits than its factorization.
110143431513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236068 (or 236065 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 110143431513 its reverse (315134341011), we get a palindrome (425277772524).
The spelling of 110143431513 in words is "one hundred ten billion, one hundred forty-three million, four hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.338 sec. • engine limits •