Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0010000101001001111 |
3 | 110110011000210212020201 |
4 | 1321102120100221033 |
5 | 4113203131011343 |
6 | 135454412354331 |
7 | 12260151113044 |
oct | 1712230205117 |
9 | 413130725221 |
10 | 130231110223 |
11 | 5025a080715 |
12 | 212a61759a7 |
13 | c385a32246 |
14 | 64360691cb |
15 | 35c32b594d |
hex | 1e52610a4f |
130231110223 has 2 divisors, whose sum is σ = 130231110224. Its totient is φ = 130231110222.
The previous prime is 130231110187. The next prime is 130231110239. The reversal of 130231110223 is 322011132031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130231110223 - 29 = 130231109711 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130231110223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130231110283) 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, 65115555111 + 65115555112.
It is an arithmetic number, because the mean of its divisors is an integer number (65115555112).
Almost surely, 2130231110223 is an apocalyptic number.
130231110223 is a deficient number, since it is larger than the sum of its proper divisors (1).
130231110223 is an equidigital number, since it uses as much as digits as its factorization.
130231110223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 130231110223 its reverse (322011132031), we get a palindrome (452242242254).
The spelling of 130231110223 in words is "one hundred thirty billion, two hundred thirty-one million, one hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •