Base | Representation |
---|---|
bin | 111110110001100001… |
… | …0011001001110000110 |
3 | 110212221211102220010000 |
4 | 1331203002121032012 |
5 | 4202040210330100 |
6 | 141532342542130 |
7 | 12511415223654 |
oct | 1754302311606 |
9 | 425854386100 |
10 | 134805558150 |
11 | 5219725009a |
12 | 22162137946 |
13 | c934673c73 |
14 | 674b7d3dd4 |
15 | 378ebac900 |
hex | 1f63099386 |
134805558150 has 60 divisors (see below), whose sum is σ = 374559750972. Its totient is φ = 35948147760.
The previous prime is 134805558089. The next prime is 134805558161. The reversal of 134805558150 is 51855508431.
134805558150 is a `hidden beast` number, since 1 + 3 + 4 + 80 + 5 + 558 + 15 + 0 = 666.
134805558150 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 134805558096 and 134805558105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 16638612 + ... + 16646711.
Almost surely, 2134805558150 is an apocalyptic number.
134805558150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134805558150 is an abundant number, since it is smaller than the sum of its proper divisors (239754192822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134805558150 is a wasteful number, since it uses less digits than its factorization.
134805558150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33285347 (or 33285333 counting only the distinct ones).
The product of its (nonzero) digits is 480000, while the sum is 45.
The spelling of 134805558150 in words is "one hundred thirty-four billion, eight hundred five million, five hundred fifty-eight thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •