Base | Representation |
---|---|
bin | 1111111110101… |
… | …11100010100000 |
3 | 100100020112202220 |
4 | 13333113202200 |
5 | 233304131000 |
6 | 21145111040 |
7 | 3215265105 |
oct | 777274240 |
9 | 310215686 |
10 | 134052000 |
11 | 6973a285 |
12 | 38a88480 |
13 | 21a06c14 |
14 | 13b36aac |
15 | bb7e1a0 |
hex | 7fd78a0 |
134052000 has 96 divisors (see below), whose sum is σ = 439193664. Its totient is φ = 35744000.
The previous prime is 134051969. The next prime is 134052041. The reversal of 134052000 is 250431.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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, 6415 + ... + 17585.
It is an arithmetic number, because the mean of its divisors is an integer number (4574934).
Almost surely, 2134052000 is an apocalyptic number.
134052000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219596832).
134052000 is an abundant number, since it is smaller than the sum of its proper divisors (305141664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134052000 is a wasteful number, since it uses less digits than its factorization.
134052000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11199 (or 11181 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 134052000 is about 11578.0827428379. The cubic root of 134052000 is about 511.7891791550.
The spelling of 134052000 in words is "one hundred thirty-four million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •