Base | Representation |
---|---|
bin | 111100110110011010… |
… | …1001101000000000101 |
3 | 110111021221212222100202 |
4 | 1321230311031000011 |
5 | 4120110233430333 |
6 | 140010424420245 |
7 | 12304150236455 |
oct | 1715465150005 |
9 | 414257788322 |
10 | 130674905093 |
11 | 50467639337 |
12 | 213aa917685 |
13 | c426968765 |
14 | 6478d8dd65 |
15 | 35ec22a5e8 |
hex | 1e6cd4d005 |
130674905093 has 2 divisors, whose sum is σ = 130674905094. Its totient is φ = 130674905092.
The previous prime is 130674905069. The next prime is 130674905111. The reversal of 130674905093 is 390509476031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120424962529 + 10249942564 = 347023^2 + 101242^2 .
It is a cyclic number.
It is not a de Polignac number, because 130674905093 - 214 = 130674888709 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 (130674905593) 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, 65337452546 + 65337452547.
It is an arithmetic number, because the mean of its divisors is an integer number (65337452547).
Almost surely, 2130674905093 is an apocalyptic number.
It is an amenable number.
130674905093 is a deficient number, since it is larger than the sum of its proper divisors (1).
130674905093 is an equidigital number, since it uses as much as digits as its factorization.
130674905093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 612360, while the sum is 47.
The spelling of 130674905093 in words is "one hundred thirty billion, six hundred seventy-four million, nine hundred five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •