Base | Representation |
---|---|
bin | 11110100011001111110010… |
… | …001011111100000000110000 |
3 | 122121202000202002101022021220 |
4 | 132203033302023330000300 |
5 | 120102402444413331212 |
6 | 1153433430141145040 |
7 | 40205305260325524 |
oct | 3643176213740060 |
9 | 577660662338256 |
10 | 134363525136432 |
11 | 398a32840a9349 |
12 | 130a067485b180 |
13 | 59c8570067337 |
14 | 252732d355d84 |
15 | 1080184b8a38c |
hex | 7a33f22fc030 |
134363525136432 has 40 divisors (see below), whose sum is σ = 347319904113840. Its totient is φ = 44760211925760.
The previous prime is 134363525136431. The next prime is 134363525136457. The reversal of 134363525136432 is 234631525363431.
It is not an unprimeable number, because it can be changed into a prime (134363525136431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 863352207 + ... + 863507822.
It is an arithmetic number, because the mean of its divisors is an integer number (8682997602846).
Almost surely, 2134363525136432 is an apocalyptic number.
134363525136432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134363525136432 is an abundant number, since it is smaller than the sum of its proper divisors (212956378977408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134363525136432 is a wasteful number, since it uses less digits than its factorization.
134363525136432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726861661 (or 1726861655 counting only the distinct ones).
The product of its digits is 13996800, while the sum is 51.
The spelling of 134363525136432 in words is "one hundred thirty-four trillion, three hundred sixty-three billion, five hundred twenty-five million, one hundred thirty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •