Base | Representation |
---|---|
bin | 110011001111001101… |
… | …1010110101000101011 |
3 | 101112000022220112011210 |
4 | 1212132123112220223 |
5 | 3300321212400011 |
6 | 122314214524203 |
7 | 10643461604235 |
oct | 1463633265053 |
9 | 345008815153 |
10 | 110032153131 |
11 | 4273431124a |
12 | 193a9666663 |
13 | a4b7076c24 |
14 | 547b593255 |
15 | 2cded496a6 |
hex | 199e6d6a2b |
110032153131 has 16 divisors (see below), whose sum is σ = 147158569728. Its totient is φ = 73130584800.
The previous prime is 110032153109. The next prime is 110032153151. The reversal of 110032153131 is 131351230011.
It is not a de Polignac number, because 110032153131 - 221 = 110030055979 is a prime.
It is a super-2 number, since 2×1100321531312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110032153098 and 110032153107.
It is not an unprimeable number, because it can be changed into a prime (110032153151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1306426 + ... + 1388096.
It is an arithmetic number, because the mean of its divisors is an integer number (9197410608).
Almost surely, 2110032153131 is an apocalyptic number.
110032153131 is a deficient number, since it is larger than the sum of its proper divisors (37126416597).
110032153131 is an equidigital number, since it uses as much as digits as its factorization.
110032153131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83042.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 110032153131 its reverse (131351230011), we get a palindrome (241383383142).
The spelling of 110032153131 in words is "one hundred ten billion, thirty-two million, one hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •