Base | Representation |
---|---|
bin | 110011010100010011… |
… | …1100000111100001111 |
3 | 101112110020121012100100 |
4 | 1212220213200330033 |
5 | 3301143444110411 |
6 | 122343203102143 |
7 | 10650636002211 |
oct | 1465047407417 |
9 | 345406535310 |
10 | 110203113231 |
11 | 4281186a092 |
12 | 19436971953 |
13 | a513604253 |
14 | 54961765b1 |
15 | 2ceed69456 |
hex | 19a89e0f0f |
110203113231 has 12 divisors (see below), whose sum is σ = 159196372920. Its totient is φ = 73462235280.
The previous prime is 110203113227. The next prime is 110203113263. The reversal of 110203113231 is 132311302011.
110203113231 is a `hidden beast` number, since 1 + 10 + 20 + 311 + 323 + 1 = 666.
It is not a de Polignac number, because 110203113231 - 22 = 110203113227 is a prime.
It is a super-2 number, since 2×1102031132312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110203113211) 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, 433836 + ... + 639233.
It is an arithmetic number, because the mean of its divisors is an integer number (13266364410).
Almost surely, 2110203113231 is an apocalyptic number.
110203113231 is a deficient number, since it is larger than the sum of its proper divisors (48993259689).
110203113231 is a wasteful number, since it uses less digits than its factorization.
110203113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084486 (or 1084483 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 110203113231 its reverse (132311302011), we get a palindrome (242514415242).
The spelling of 110203113231 in words is "one hundred ten billion, two hundred three million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •