Base | Representation |
---|---|
bin | 111110011001100101… |
… | …0101111111100010000 |
3 | 110210212212020100212102 |
4 | 1330303022233330100 |
5 | 4143414111121000 |
6 | 141320533215532 |
7 | 12452463651320 |
oct | 1746312577420 |
9 | 423785210772 |
10 | 134002442000 |
11 | 51914981039 |
12 | 21b791915a8 |
13 | c83716c8cb |
14 | 66b2c97280 |
15 | 374441c3d5 |
hex | 1f332aff10 |
134002442000 has 160 divisors (see below), whose sum is σ = 370557068544. Its totient is φ = 45912576000.
The previous prime is 134002441913. The next prime is 134002442009. The reversal of 134002442000 is 244200431.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (134002442009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31819895 + ... + 31824105.
Almost surely, 2134002442000 is an apocalyptic number.
134002442000 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 134002442000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185278534272).
134002442000 is an abundant number, since it is smaller than the sum of its proper divisors (236554626544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134002442000 is a wasteful number, since it uses less digits than its factorization.
134002442000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6514 (or 6498 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 134002442000 its reverse (244200431), we get a palindrome (134246642431).
The spelling of 134002442000 in words is "one hundred thirty-four billion, two million, four hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •