Base | Representation |
---|---|
bin | 10000000000011… |
… | …01110000000010 |
3 | 100100122211100222 |
4 | 20000031300002 |
5 | 233333232200 |
6 | 21153543042 |
7 | 3220211351 |
oct | 1000156002 |
9 | 310584328 |
10 | 134274050 |
11 | 69881099 |
12 | 38b74a82 |
13 | 21a84001 |
14 | 13b93998 |
15 | bbc4d85 |
hex | 800dc02 |
134274050 has 12 divisors (see below), whose sum is σ = 249749826. Its totient is φ = 53709600.
The previous prime is 134274047. The next prime is 134274053. The reversal of 134274050 is 50472431.
134274050 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (134274047) and next prime (134274053).
It can be written as a sum of positive squares in 3 ways, for example, as 95199049 + 39075001 = 9757^2 + 6251^2 .
It is not an unprimeable number, because it can be changed into a prime (134274053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1342691 + ... + 1342790.
Almost surely, 2134274050 is an apocalyptic number.
134274050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134274050 is a deficient number, since it is larger than the sum of its proper divisors (115475776).
134274050 is a wasteful number, since it uses less digits than its factorization.
134274050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2685493 (or 2685488 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 134274050 is about 11587.6680138844. The cubic root of 134274050 is about 512.0716071112.
The spelling of 134274050 in words is "one hundred thirty-four million, two hundred seventy-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •