Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0110100001101010111 |
3 | 101112012202122012202011 |
4 | 1212203010310031113 |
5 | 3301001143143111 |
6 | 122330042125051 |
7 | 10645426446115 |
oct | 1464304641527 |
9 | 345182565664 |
10 | 110110131031 |
11 | 4277433119a |
12 | 1940b7b0787 |
13 | a4ca279ab4 |
14 | 5487a90ab5 |
15 | 2ce6aee021 |
hex | 19a3134357 |
110110131031 has 4 divisors (see below), whose sum is σ = 110548817064. Its totient is φ = 109671445000.
The previous prime is 110110130971. The next prime is 110110131049. The reversal of 110110131031 is 130131011011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110110131031 - 29 = 110110130519 is a prime.
It is a super-2 number, since 2×1101101310312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110131071) 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, 219342640 + ... + 219343141.
It is an arithmetic number, because the mean of its divisors is an integer number (27637204266).
Almost surely, 2110110131031 is an apocalyptic number.
110110131031 is a deficient number, since it is larger than the sum of its proper divisors (438686033).
110110131031 is an equidigital number, since it uses as much as digits as its factorization.
110110131031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438686032.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 110110131031 its reverse (130131011011), we get a palindrome (240241142042).
The spelling of 110110131031 in words is "one hundred ten billion, one hundred ten million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •