Base | Representation |
---|---|
bin | 11001000001001010101001… |
… | …010101111110111010001011 |
3 | 112102120220001102001021221211 |
4 | 121001022221111332322023 |
5 | 103410223112201114011 |
6 | 1030003404300313551 |
7 | 32114333342264635 |
oct | 3101125125767213 |
9 | 472526042037854 |
10 | 110031313301131 |
11 | 32072021936862 |
12 | 104109802428b7 |
13 | 4951ba677a801 |
14 | 1d2578896da55 |
15 | cac2787a7b21 |
hex | 6412a957ee8b |
110031313301131 has 4 divisors (see below), whose sum is σ = 110031355060200. Its totient is φ = 110031271542064.
The previous prime is 110031313301011. The next prime is 110031313301141. The reversal of 110031313301131 is 131103313130011.
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 110031313301131 - 217 = 110031313170059 is a prime.
It is a super-2 number, since 2×1100313133011312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110031313301141) 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, 16640266 + ... + 22292623.
It is an arithmetic number, because the mean of its divisors is an integer number (27507838765050).
Almost surely, 2110031313301131 is an apocalyptic number.
110031313301131 is a deficient number, since it is larger than the sum of its proper divisors (41759069).
110031313301131 is an equidigital number, since it uses as much as digits as its factorization.
110031313301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41759068.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 110031313301131 its reverse (131103313130011), we get a palindrome (241134626431142).
The spelling of 110031313301131 in words is "one hundred ten trillion, thirty-one billion, three hundred thirteen million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •