Base | Representation |
---|---|
bin | 10000000001000… |
… | …01011110011000 |
3 | 100100210221012012 |
4 | 20000201132120 |
5 | 233343323330 |
6 | 21155405052 |
7 | 3220666034 |
oct | 1000413630 |
9 | 310727165 |
10 | 134354840 |
11 | 69926864 |
12 | 38bb3788 |
13 | 21ab1a09 |
14 | 13bb51c4 |
15 | bbddc95 |
hex | 8021798 |
134354840 has 32 divisors (see below), whose sum is σ = 304123680. Its totient is φ = 53417472.
The previous prime is 134354819. The next prime is 134354861. The reversal of 134354840 is 48453431.
It is an interprime number because it is at equal distance from previous prime (134354819) and next prime (134354861).
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 134354797 and 134354806.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3377 + ... + 16736.
It is an arithmetic number, because the mean of its divisors is an integer number (9503865).
Almost surely, 2134354840 is an apocalyptic number.
134354840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134354840 is an abundant number, since it is smaller than the sum of its proper divisors (169768840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134354840 is a wasteful number, since it uses less digits than its factorization.
134354840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20291 (or 20287 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
The square root of 134354840 is about 11591.1535232694. The cubic root of 134354840 is about 512.1742875887.
The spelling of 134354840 in words is "one hundred thirty-four million, three hundred fifty-four thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •