Base | Representation |
---|---|
bin | 111100101111001111… |
… | …1011100111010101011 |
3 | 110110200012012002112012 |
4 | 1321132133130322223 |
5 | 4114112141301331 |
6 | 135530512110135 |
7 | 12265166305343 |
oct | 1713637347253 |
9 | 413605162465 |
10 | 130434322091 |
11 | 50353857807 |
12 | 2134223534b |
13 | c3b8b72458 |
14 | 6455045d23 |
15 | 35d605682b |
hex | 1e5e7dceab |
130434322091 has 2 divisors, whose sum is σ = 130434322092. Its totient is φ = 130434322090.
The previous prime is 130434322049. The next prime is 130434322093. The reversal of 130434322091 is 190223434031.
It is a strong prime.
It is an emirp because it is prime and its reverse (190223434031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130434322091 - 210 = 130434321067 is a prime.
It is a super-2 number, since 2×1304343220912 (a number of 23 digits) contains 22 as substring.
Together with 130434322093, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (130434322093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65217161045 + 65217161046.
It is an arithmetic number, because the mean of its divisors is an integer number (65217161046).
Almost surely, 2130434322091 is an apocalyptic number.
130434322091 is a deficient number, since it is larger than the sum of its proper divisors (1).
130434322091 is an equidigital number, since it uses as much as digits as its factorization.
130434322091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 130434322091 in words is "one hundred thirty billion, four hundred thirty-four million, three hundred twenty-two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •