Base | Representation |
---|---|
bin | 111110100100110011… |
… | …0000011000011100001 |
3 | 110211212002020002121011 |
4 | 1331021212003003201 |
5 | 4200201421300204 |
6 | 141422133500521 |
7 | 12465013035421 |
oct | 1751146030341 |
9 | 424762202534 |
10 | 134378696929 |
11 | 51a982a8a24 |
12 | 220631a1741 |
13 | c8970b9269 |
14 | 670ac3a481 |
15 | 3767490304 |
hex | 1f499830e1 |
134378696929 has 9 divisors (see below), whose sum is σ = 135734149233. Its totient is φ = 133036658532.
The previous prime is 134378696923. The next prime is 134378696939. The reversal of 134378696929 is 929696873431.
The square root of 134378696929 is 366577.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 134378696929 - 211 = 134378694881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134378696923) 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 in 8 ways as a sum of consecutive naturals, for example, 37755652 + ... + 37759210.
It is an arithmetic number, because the mean of its divisors is an integer number (15081572137).
Almost surely, 2134378696929 is an apocalyptic number.
134378696929 is the 366577-th square number.
134378696929 is the 183289-th centered octagonal number.
It is an amenable number.
134378696929 is a deficient number, since it is larger than the sum of its proper divisors (1355452304).
134378696929 is an frugal number, since it uses more digits than its factorization.
134378696929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7324 (or 3662 counting only the distinct ones).
The product of its digits is 105815808, while the sum is 67.
The spelling of 134378696929 in words is "one hundred thirty-four billion, three hundred seventy-eight million, six hundred ninety-six thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •