Base | Representation |
---|---|
bin | 111100111100111100… |
… | …1010101100111000001 |
3 | 110111212020022212021122 |
4 | 1321321321111213001 |
5 | 4121032341431422 |
6 | 140044254402025 |
7 | 12312451300502 |
oct | 1717171254701 |
9 | 414766285248 |
10 | 130894092737 |
11 | 5056a337251 |
12 | 21450200315 |
13 | c4601b04a5 |
14 | 649a128ba9 |
15 | 36115c4d42 |
hex | 1e79e559c1 |
130894092737 has 2 divisors, whose sum is σ = 130894092738. Its totient is φ = 130894092736.
The previous prime is 130894092733. The next prime is 130894092757. The reversal of 130894092737 is 737290498031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81489695296 + 49404397441 = 285464^2 + 222271^2 .
It is a cyclic number.
It is not a de Polignac number, because 130894092737 - 22 = 130894092733 is a prime.
It is not a weakly prime, because it can be changed into another prime (130894092733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65447046368 + 65447046369.
It is an arithmetic number, because the mean of its divisors is an integer number (65447046369).
Almost surely, 2130894092737 is an apocalyptic number.
It is an amenable number.
130894092737 is a deficient number, since it is larger than the sum of its proper divisors (1).
130894092737 is an equidigital number, since it uses as much as digits as its factorization.
130894092737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 53.
The spelling of 130894092737 in words is "one hundred thirty billion, eight hundred ninety-four million, ninety-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •