Base | Representation |
---|---|
bin | 110011010111100001… |
… | …1001001101000111001 |
3 | 101112201202122111010120 |
4 | 1212233003021220321 |
5 | 3301404110133423 |
6 | 122402020003453 |
7 | 10653416131356 |
oct | 1465703115071 |
9 | 345652574116 |
10 | 110311021113 |
11 | 42867771957 |
12 | 19466b30589 |
13 | a52ca86277 |
14 | 54a662562d |
15 | 2d09581ee3 |
hex | 19af0c9a39 |
110311021113 has 32 divisors (see below), whose sum is σ = 154096992000. Its totient is φ = 70116224256.
The previous prime is 110311021103. The next prime is 110311021129. The reversal of 110311021113 is 311120113011.
It is not a de Polignac number, because 110311021113 - 210 = 110311020089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110311021092 and 110311021101.
It is not an unprimeable number, because it can be changed into a prime (110311021103) 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 31 ways as a sum of consecutive naturals, for example, 4924663 + ... + 4947011.
It is an arithmetic number, because the mean of its divisors is an integer number (4815531000).
Almost surely, 2110311021113 is an apocalyptic number.
It is an amenable number.
110311021113 is a deficient number, since it is larger than the sum of its proper divisors (43785970887).
110311021113 is a wasteful number, since it uses less digits than its factorization.
110311021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23281.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 110311021113 its reverse (311120113011), we get a palindrome (421431134124).
The spelling of 110311021113 in words is "one hundred ten billion, three hundred eleven million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •