Base | Representation |
---|---|
bin | 111110011011000110… |
… | …0110100001001010000 |
3 | 110211000101221222201020 |
4 | 1330312030310021100 |
5 | 4144020122041102 |
6 | 141325551435440 |
7 | 12453652243461 |
oct | 1746614641120 |
9 | 424011858636 |
10 | 134053315152 |
11 | 51940668869 |
12 | 21b92225b80 |
13 | c844872573 |
14 | 66b993ad68 |
15 | 3748b1abbc |
hex | 1f36334250 |
134053315152 has 40 divisors (see below), whose sum is σ = 349481515680. Its totient is φ = 44274487680.
The previous prime is 134053315129. The next prime is 134053315169. The reversal of 134053315152 is 251513350431.
134053315152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 12805674 + ... + 12816137.
It is an arithmetic number, because the mean of its divisors is an integer number (8737037892).
Almost surely, 2134053315152 is an apocalyptic number.
134053315152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134053315152 is an abundant number, since it is smaller than the sum of its proper divisors (215428200528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134053315152 is a wasteful number, since it uses less digits than its factorization.
134053315152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25621931 (or 25621925 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 134053315152 its reverse (251513350431), we get a palindrome (385566665583).
The spelling of 134053315152 in words is "one hundred thirty-four billion, fifty-three million, three hundred fifteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •