Base | Representation |
---|---|
bin | 111100001110011110… |
… | …0000010011101010101 |
3 | 110100211112201100011222 |
4 | 1320130330002131111 |
5 | 4104334114112022 |
6 | 135225423340125 |
7 | 12226013164241 |
oct | 1703474023525 |
9 | 410745640158 |
10 | 129334519637 |
11 | 4a939a67964 |
12 | 21095a51645 |
13 | c27206067b |
14 | 638cd59421 |
15 | 356e70e242 |
hex | 1e1cf02755 |
129334519637 has 2 divisors, whose sum is σ = 129334519638. Its totient is φ = 129334519636.
The previous prime is 129334519621. The next prime is 129334519651. The reversal of 129334519637 is 736915433921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71585142916 + 57749376721 = 267554^2 + 240311^2 .
It is an emirp because it is prime and its reverse (736915433921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 129334519637 - 24 = 129334519621 is a prime.
It is a super-2 number, since 2×1293345196372 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (129334519607) 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, 64667259818 + 64667259819.
It is an arithmetic number, because the mean of its divisors is an integer number (64667259819).
Almost surely, 2129334519637 is an apocalyptic number.
It is an amenable number.
129334519637 is a deficient number, since it is larger than the sum of its proper divisors (1).
129334519637 is an equidigital number, since it uses as much as digits as its factorization.
129334519637 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3674160, while the sum is 53.
The spelling of 129334519637 in words is "one hundred twenty-nine billion, three hundred thirty-four million, five hundred nineteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •