Base | Representation |
---|---|
bin | 110011010101001001… |
… | …1100101111010001011 |
3 | 101112112012220121101222 |
4 | 1212222103211322023 |
5 | 3301223222221011 |
6 | 122350054232255 |
7 | 10651431552413 |
oct | 1465223457213 |
9 | 345465817358 |
10 | 110231445131 |
11 | 42826860285 |
12 | 1944435568b |
13 | a519443ba2 |
14 | 5499c2d643 |
15 | 2d025b3ddb |
hex | 19aa4e5e8b |
110231445131 has 4 divisors (see below), whose sum is σ = 112038518064. Its totient is φ = 108424372200.
The previous prime is 110231445119. The next prime is 110231445157. The reversal of 110231445131 is 131544132011.
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 110231445131 - 218 = 110231182987 is a prime.
It is a super-2 number, since 2×1102314451312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110231445131.
It is not an unprimeable number, because it can be changed into a prime (110231475131) 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, 903536375 + ... + 903536496.
It is an arithmetic number, because the mean of its divisors is an integer number (28009629516).
Almost surely, 2110231445131 is an apocalyptic number.
110231445131 is a deficient number, since it is larger than the sum of its proper divisors (1807072933).
110231445131 is an equidigital number, since it uses as much as digits as its factorization.
110231445131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1807072932.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 110231445131 its reverse (131544132011), we get a palindrome (241775577142).
The spelling of 110231445131 in words is "one hundred ten billion, two hundred thirty-one million, four hundred forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •