Base | Representation |
---|---|
bin | 110011010010001010… |
… | …0111011001011110010 |
3 | 101112021020011010110022 |
4 | 1212210110323023302 |
5 | 3301022032143442 |
6 | 122332112203442 |
7 | 10646103111635 |
oct | 1464424731362 |
9 | 345236133408 |
10 | 110131131122 |
11 | 42785174941 |
12 | 19416839582 |
13 | a50172049c |
14 | 548a799c1c |
15 | 2ce889b3d2 |
hex | 19a453b2f2 |
110131131122 has 4 divisors (see below), whose sum is σ = 165196696686. Its totient is φ = 55065565560.
The previous prime is 110131131113. The next prime is 110131131133. The reversal of 110131131122 is 221131131011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 107034319921 + 3096811201 = 327161^2 + 55649^2 .
It is a super-2 number, since 2×1101311311222 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110131131122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27532782779 + ... + 27532782782.
Almost surely, 2110131131122 is an apocalyptic number.
110131131122 is a deficient number, since it is larger than the sum of its proper divisors (55065565564).
110131131122 is an equidigital number, since it uses as much as digits as its factorization.
110131131122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55065565563.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 110131131122 its reverse (221131131011), we get a palindrome (331262262133).
The spelling of 110131131122 in words is "one hundred ten billion, one hundred thirty-one million, one hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •