Base | Representation |
---|---|
bin | 110011010111100011… |
… | …0110010100011100001 |
3 | 101112201211102221210210 |
4 | 1212233012302203201 |
5 | 3301404331201022 |
6 | 122402052244333 |
7 | 10653430213650 |
oct | 1465706624341 |
9 | 345654387723 |
10 | 110311975137 |
11 | 42868263701 |
12 | 194673106a9 |
13 | a53002b590 |
14 | 54a67d3197 |
15 | 2d096bea0c |
hex | 19af1b28e1 |
110311975137 has 16 divisors (see below), whose sum is σ = 181024780160. Its totient is φ = 58186536192.
The previous prime is 110311975127. The next prime is 110311975171. The reversal of 110311975137 is 731579113011.
It is not a de Polignac number, because 110311975137 - 214 = 110311958753 is a prime.
It is a super-2 number, since 2×1103119751372 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 110311975095 and 110311975104.
It is not an unprimeable number, because it can be changed into a prime (110311975127) 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 15 ways as a sum of consecutive naturals, for example, 202036312 + ... + 202036857.
It is an arithmetic number, because the mean of its divisors is an integer number (11314048760).
Almost surely, 2110311975137 is an apocalyptic number.
It is an amenable number.
110311975137 is a deficient number, since it is larger than the sum of its proper divisors (70712805023).
110311975137 is a wasteful number, since it uses less digits than its factorization.
110311975137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404073192.
The product of its (nonzero) digits is 19845, while the sum is 39.
The spelling of 110311975137 in words is "one hundred ten billion, three hundred eleven million, nine hundred seventy-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •