Base | Representation |
---|---|
bin | 11101110001111000011000… |
… | …111000111100011111111001 |
3 | 122011201201102122122101001202 |
4 | 131301320120320330133321 |
5 | 114131312403434232043 |
6 | 1142315152115223545 |
7 | 36405232125123365 |
oct | 3561703070743771 |
9 | 564651378571052 |
10 | 130971150305273 |
11 | 38805609a33503 |
12 | 128331052a7bb5 |
13 | 58106ac8a0935 |
14 | 244b074c722a5 |
15 | 1021cd81a71b8 |
hex | 771e18e3c7f9 |
130971150305273 has 2 divisors, whose sum is σ = 130971150305274. Its totient is φ = 130971150305272.
The previous prime is 130971150305249. The next prime is 130971150305327. The reversal of 130971150305273 is 372503051179031.
It is a happy number.
Together with next prime (130971150305327) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78890492449024 + 52080657856249 = 8882032^2 + 7216693^2 .
It is a cyclic number.
It is not a de Polignac number, because 130971150305273 - 224 = 130971133528057 is a prime.
It is not a weakly prime, because it can be changed into another prime (130971150335273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65485575152636 + 65485575152637.
It is an arithmetic number, because the mean of its divisors is an integer number (65485575152637).
Almost surely, 2130971150305273 is an apocalyptic number.
It is an amenable number.
130971150305273 is a deficient number, since it is larger than the sum of its proper divisors (1).
130971150305273 is an equidigital number, since it uses as much as digits as its factorization.
130971150305273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 595350, while the sum is 47.
The spelling of 130971150305273 in words is "one hundred thirty trillion, nine hundred seventy-one billion, one hundred fifty million, three hundred five thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •