Base | Representation |
---|---|
bin | 110011010010010010… |
… | …1101101011000000011 |
3 | 101112021112102122222011 |
4 | 1212210211231120003 |
5 | 3301024143443021 |
6 | 122332350353351 |
7 | 10646155365412 |
oct | 1464445553003 |
9 | 345245378864 |
10 | 110135531011 |
11 | 427876aa610 |
12 | 194181bb857 |
13 | a50260107c |
14 | 548b1c3479 |
15 | 2ce8e69de1 |
hex | 19a496d603 |
110135531011 has 8 divisors (see below), whose sum is σ = 122414793264. Its totient is φ = 98234092320.
The previous prime is 110135530993. The next prime is 110135531041.
110135531011 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110135531011 - 25 = 110135530979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110135531041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94455276 + ... + 94456441.
It is an arithmetic number, because the mean of its divisors is an integer number (15301849158).
Almost surely, 2110135531011 is an apocalyptic number.
110135531011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110135531011 is a deficient number, since it is larger than the sum of its proper divisors (12279262253).
110135531011 is a wasteful number, since it uses less digits than its factorization.
110135531011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188911781.
The product of its (nonzero) digits is 225, while the sum is 22.
It can be divided in two parts, 110135 and 531011, that added together give a palindrome (641146).
The spelling of 110135531011 in words is "one hundred ten billion, one hundred thirty-five million, five hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •