Base | Representation |
---|---|
bin | 111110011011100001… |
… | …1110100011000100100 |
3 | 110211001102002112201120 |
4 | 1330313003310120210 |
5 | 4144032314442202 |
6 | 141331224453540 |
7 | 12454215636210 |
oct | 1746703643044 |
9 | 424042075646 |
10 | 134067734052 |
11 | 51948816a0a |
12 | 21b9701a2b0 |
13 | c847850565 |
14 | 66bb811940 |
15 | 374a0180bc |
hex | 1f370f4624 |
134067734052 has 48 divisors (see below), whose sum is σ = 362850001920. Its totient is φ = 37733347872.
The previous prime is 134067734041. The next prime is 134067734057. The reversal of 134067734052 is 250437760431.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 134067733995 and 134067734013.
It is not an unprimeable number, because it can be changed into a prime (134067734057) 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 15 ways as a sum of consecutive naturals, for example, 11905152 + ... + 11916407.
It is an arithmetic number, because the mean of its divisors is an integer number (7559375040).
Almost surely, 2134067734052 is an apocalyptic number.
134067734052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134067734052 is an abundant number, since it is smaller than the sum of its proper divisors (228782267868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134067734052 is a wasteful number, since it uses less digits than its factorization.
134067734052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23821640 (or 23821638 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 42.
The spelling of 134067734052 in words is "one hundred thirty-four billion, sixty-seven million, seven hundred thirty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •