Base | Representation |
---|---|
bin | 10000000100010… |
… | …11110110011110 |
3 | 100101122001212220 |
4 | 20002023312132 |
5 | 234001244213 |
6 | 21213010210 |
7 | 3224462250 |
oct | 1002136636 |
9 | 311561786 |
10 | 134790558 |
11 | 6a0a4161 |
12 | 39183966 |
13 | 21c05136 |
14 | 13c89cd0 |
15 | bc77e23 |
hex | 808bd9e |
134790558 has 32 divisors (see below), whose sum is σ = 312320256. Its totient is φ = 37983168.
The previous prime is 134790553. The next prime is 134790559. The reversal of 134790558 is 855097431.
134790558 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1347905583 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134790553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18916 + ... + 25047.
It is an arithmetic number, because the mean of its divisors is an integer number (9760008).
Almost surely, 2134790558 is an apocalyptic number.
134790558 is an abundant number, since it is smaller than the sum of its proper divisors (177529698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134790558 is a wasteful number, since it uses less digits than its factorization.
134790558 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44048.
The product of its (nonzero) digits is 151200, while the sum is 42.
The square root of 134790558 is about 11609.9335915413. The cubic root of 134790558 is about 512.7273572243.
The spelling of 134790558 in words is "one hundred thirty-four million, seven hundred ninety thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •