Base | Representation |
---|---|
bin | 111110011010000111… |
… | …0001110011001000011 |
3 | 110210221002112000202021 |
4 | 1330310032032121003 |
5 | 4143433123132441 |
6 | 141322404302311 |
7 | 12453100212031 |
oct | 1746416163103 |
9 | 423832460667 |
10 | 134020130371 |
11 | 51923962626 |
12 | 21b830a1997 |
13 | c83aa23aba |
14 | 66b537d551 |
15 | 3745c633d1 |
hex | 1f3438e643 |
134020130371 has 2 divisors, whose sum is σ = 134020130372. Its totient is φ = 134020130370.
The previous prime is 134020130369. The next prime is 134020130423. The reversal of 134020130371 is 173031020431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 134020130371 - 21 = 134020130369 is a prime.
It is a super-2 number, since 2×1340201303712 (a number of 23 digits) contains 22 as substring.
Together with 134020130369, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (134020133371) 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, 67010065185 + 67010065186.
It is an arithmetic number, because the mean of its divisors is an integer number (67010065186).
Almost surely, 2134020130371 is an apocalyptic number.
134020130371 is a deficient number, since it is larger than the sum of its proper divisors (1).
134020130371 is an equidigital number, since it uses as much as digits as its factorization.
134020130371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
The spelling of 134020130371 in words is "one hundred thirty-four billion, twenty million, one hundred thirty thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •