Base | Representation |
---|---|
bin | 110011010010001000… |
… | …1110101101001101111 |
3 | 101112021011122000120222 |
4 | 1212210101311221233 |
5 | 3301021330301111 |
6 | 122332043001555 |
7 | 10646063202032 |
oct | 1464421655157 |
9 | 345234560528 |
10 | 110130322031 |
11 | 42784771a74 |
12 | 194165092bb |
13 | a5014c9132 |
14 | 548a629019 |
15 | 2ce878b7db |
hex | 19a4475a6f |
110130322031 has 4 divisors (see below), whose sum is σ = 110859662064. Its totient is φ = 109400982000.
The previous prime is 110130322009. The next prime is 110130322037. The reversal of 110130322031 is 130223031011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130223031011 = 107 ⋅1217037673.
It is a cyclic number.
It is not a de Polignac number, because 110130322031 - 230 = 109056580207 is a prime.
It is a super-2 number, since 2×1101303220312 (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 (110130322037) 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, 364669790 + ... + 364670091.
It is an arithmetic number, because the mean of its divisors is an integer number (27714915516).
Almost surely, 2110130322031 is an apocalyptic number.
110130322031 is a deficient number, since it is larger than the sum of its proper divisors (729340033).
110130322031 is an equidigital number, since it uses as much as digits as its factorization.
110130322031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729340032.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110130322031 its reverse (130223031011), we get a palindrome (240353353042).
The spelling of 110130322031 in words is "one hundred ten billion, one hundred thirty million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •