Base | Representation |
---|---|
bin | 111110100111011011… |
… | …1000110001000010100 |
3 | 110212002020111000001010 |
4 | 1331032313012020110 |
5 | 4200342031131202 |
6 | 141435011332220 |
7 | 12500135040504 |
oct | 1751667061024 |
9 | 425066430033 |
10 | 134467052052 |
11 | 52033166493 |
12 | 220888b1070 |
13 | c8ac4b35b8 |
14 | 6718879a04 |
15 | 37700e476c |
hex | 1f4edc6214 |
134467052052 has 24 divisors (see below), whose sum is σ = 313787325600. Its totient is φ = 44817940576.
The previous prime is 134467052021. The next prime is 134467052059. The reversal of 134467052052 is 250250764431.
It is a self number, because there is not a number n which added to its sum of digits gives 134467052052.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134467052059) 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 7 ways as a sum of consecutive naturals, for example, 423027 + ... + 669242.
It is an arithmetic number, because the mean of its divisors is an integer number (13074471900).
Almost surely, 2134467052052 is an apocalyptic number.
134467052052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134467052052 is an abundant number, since it is smaller than the sum of its proper divisors (179320273548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134467052052 is a wasteful number, since it uses less digits than its factorization.
134467052052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102535 (or 1102533 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 39.
The spelling of 134467052052 in words is "one hundred thirty-four billion, four hundred sixty-seven million, fifty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •