Base | Representation |
---|---|
bin | 110011010010001010… |
… | …0111011001011111011 |
3 | 101112021020011010110122 |
4 | 1212210110323023323 |
5 | 3301022032144011 |
6 | 122332112203455 |
7 | 10646103111650 |
oct | 1464424731373 |
9 | 345236133418 |
10 | 110131131131 |
11 | 4278517494a |
12 | 1941683958b |
13 | a5017204a8 |
14 | 548a799c27 |
15 | 2ce889b3db |
hex | 19a453b2fb |
110131131131 has 4 divisors (see below), whose sum is σ = 125864149872. Its totient is φ = 94398112392.
The previous prime is 110131131113. The next prime is 110131131133. The reversal of 110131131131 is 131131131011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110131131131 is a prime.
It is a super-2 number, since 2×1101311311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110131131133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7866509360 + ... + 7866509373.
It is an arithmetic number, because the mean of its divisors is an integer number (31466037468).
Almost surely, 2110131131131 is an apocalyptic number.
110131131131 is a deficient number, since it is larger than the sum of its proper divisors (15733018741).
110131131131 is an equidigital number, since it uses as much as digits as its factorization.
110131131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15733018740.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 110131131131 its reverse (131131131011), we get a palindrome (241262262142).
The spelling of 110131131131 in words is "one hundred ten billion, one hundred thirty-one million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •