Base | Representation |
---|---|
bin | 111100101001001110… |
… | …0100010100011101101 |
3 | 110110011002220212021102 |
4 | 1321102130202203231 |
5 | 4113203422412143 |
6 | 135454452412445 |
7 | 12260163465041 |
oct | 1712234424355 |
9 | 413132825242 |
10 | 130232232173 |
11 | 5025a77764a |
12 | 212a6617125 |
13 | c386035b14 |
14 | 643627c021 |
15 | 35c34380b8 |
hex | 1e527228ed |
130232232173 has 2 divisors, whose sum is σ = 130232232174. Its totient is φ = 130232232172.
The previous prime is 130232232167. The next prime is 130232232191. The reversal of 130232232173 is 371232232031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89806304329 + 40425927844 = 299677^2 + 201062^2 .
It is an emirp because it is prime and its reverse (371232232031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130232232173 - 28 = 130232231917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130232732173) by changing a digit.
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, 65116116086 + 65116116087.
It is an arithmetic number, because the mean of its divisors is an integer number (65116116087).
Almost surely, 2130232232173 is an apocalyptic number.
It is an amenable number.
130232232173 is a deficient number, since it is larger than the sum of its proper divisors (1).
130232232173 is an equidigital number, since it uses as much as digits as its factorization.
130232232173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 29.
The spelling of 130232232173 in words is "one hundred thirty billion, two hundred thirty-two million, two hundred thirty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •