Base | Representation |
---|---|
bin | 110011010101001011… |
… | …0100110000001001101 |
3 | 101112112021101120210202 |
4 | 1212222112212001031 |
5 | 3301223422411023 |
6 | 122350123143245 |
7 | 10651441340501 |
oct | 1465226460115 |
9 | 345467346722 |
10 | 110232232013 |
11 | 428272484a2 |
12 | 19444674b25 |
13 | a51965b0b7 |
14 | 5499d96301 |
15 | 2d026bc128 |
hex | 19aa5a604d |
110232232013 has 2 divisors, whose sum is σ = 110232232014. Its totient is φ = 110232232012.
The previous prime is 110232232007. The next prime is 110232232049. The reversal of 110232232013 is 310232232011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110225992009 + 6240004 = 332003^2 + 2498^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110232232013 is a prime.
It is a super-2 number, since 2×1102322320132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110232232003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55116116006 + 55116116007.
It is an arithmetic number, because the mean of its divisors is an integer number (55116116007).
Almost surely, 2110232232013 is an apocalyptic number.
It is an amenable number.
110232232013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110232232013 is an equidigital number, since it uses as much as digits as its factorization.
110232232013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 110232232013 its reverse (310232232011), we get a palindrome (420464464024).
The spelling of 110232232013 in words is "one hundred ten billion, two hundred thirty-two million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •