Base | Representation |
---|---|
bin | 111110100010101000… |
… | …1111110001101001000 |
3 | 110211200001001020102012 |
4 | 1331011101332031020 |
5 | 4200024404402240 |
6 | 141411030355052 |
7 | 12463143633446 |
oct | 1750521761510 |
9 | 424601036365 |
10 | 134306325320 |
11 | 51a60468082 |
12 | 22042abba88 |
13 | c8850ca11b |
14 | 670139bb96 |
15 | 3760e46b65 |
hex | 1f4547e348 |
134306325320 has 16 divisors (see below), whose sum is σ = 302189232060. Its totient is φ = 53722530112.
The previous prime is 134306325311. The next prime is 134306325323. The reversal of 134306325320 is 23523603431.
It can be written as a sum of positive squares in 2 ways, for example, as 127022385604 + 7283939716 = 356402^2 + 85346^2 .
It is not an unprimeable number, because it can be changed into a prime (134306325323) 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 in 3 ways as a sum of consecutive naturals, for example, 1678829027 + ... + 1678829106.
Almost surely, 2134306325320 is an apocalyptic number.
134306325320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134306325320 is an abundant number, since it is smaller than the sum of its proper divisors (167882906740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134306325320 is a wasteful number, since it uses less digits than its factorization.
134306325320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3357658144 (or 3357658140 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 32.
Adding to 134306325320 its reverse (23523603431), we get a palindrome (157829928751).
The spelling of 134306325320 in words is "one hundred thirty-four billion, three hundred six million, three hundred twenty-five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •