Base | Representation |
---|---|
bin | 10000000100011… |
… | …11101111011010 |
3 | 100101122212201222 |
4 | 20002033233122 |
5 | 234002301430 |
6 | 21213212042 |
7 | 3224556560 |
oct | 1002175732 |
9 | 311585658 |
10 | 134806490 |
11 | 6a105125 |
12 | 39191022 |
13 | 21c0c470 |
14 | 13c91a30 |
15 | bc7c9e5 |
hex | 808fbda |
134806490 has 32 divisors (see below), whose sum is σ = 298650240. Its totient is φ = 42663744.
The previous prime is 134806489. The next prime is 134806537. The reversal of 134806490 is 94608431.
134806490 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1348064902 = 36345579492240200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 134806490.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73160 + ... + 74979.
It is an arithmetic number, because the mean of its divisors is an integer number (9332820).
Almost surely, 2134806490 is an apocalyptic number.
134806490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134806490 is an abundant number, since it is smaller than the sum of its proper divisors (163843750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134806490 is a wasteful number, since it uses less digits than its factorization.
134806490 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148166.
The product of its (nonzero) digits is 20736, while the sum is 35.
The square root of 134806490 is about 11610.6197078364. The cubic root of 134806490 is about 512.7475575770.
The spelling of 134806490 in words is "one hundred thirty-four million, eight hundred six thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •