Base | Representation |
---|---|
bin | 111110011010010100… |
… | …0111010000110001101 |
3 | 110210221120200101202112 |
4 | 1330310220322012031 |
5 | 4143441421001013 |
6 | 141323214233405 |
7 | 12453213523646 |
oct | 1746450720615 |
9 | 423846611675 |
10 | 134027125133 |
11 | 519278aa920 |
12 | 21b854b5865 |
13 | c83c302805 |
14 | 66b62806cd |
15 | 3746695ba8 |
hex | 1f34a3a18d |
134027125133 has 8 divisors (see below), whose sum is σ = 146560367520. Its totient is φ = 121552042480.
The previous prime is 134027125097. The next prime is 134027125147. The reversal of 134027125133 is 331521720431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134027125133 - 26 = 134027125069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134027125133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134027125633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14535110 + ... + 14544327.
It is an arithmetic number, because the mean of its divisors is an integer number (18320045940).
Almost surely, 2134027125133 is an apocalyptic number.
It is an amenable number.
134027125133 is a deficient number, since it is larger than the sum of its proper divisors (12533242387).
134027125133 is a wasteful number, since it uses less digits than its factorization.
134027125133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29079867.
The product of its (nonzero) digits is 15120, while the sum is 32.
Adding to 134027125133 its reverse (331521720431), we get a palindrome (465548845564).
The spelling of 134027125133 in words is "one hundred thirty-four billion, twenty-seven million, one hundred twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.438 sec. • engine limits •