Base | Representation |
---|---|
bin | 111110101000100101… |
… | …0010000101000010001 |
3 | 110212011221001222100100 |
4 | 1331101022100220101 |
5 | 4200431420131400 |
6 | 141442510243013 |
7 | 12501113664351 |
oct | 1752112205021 |
9 | 425157058310 |
10 | 134505630225 |
11 | 52052a1587a |
12 | 220997b6469 |
13 | c8b749cc15 |
14 | 671da3cb61 |
15 | 37736b5100 |
hex | 1f51290a11 |
134505630225 has 36 divisors (see below), whose sum is σ = 241052665516. Its totient is φ = 71695203840.
The previous prime is 134505630223. The next prime is 134505630241. The reversal of 134505630225 is 522036505431.
134505630225 is a `hidden beast` number, since 1 + 345 + 0 + 5 + 6 + 302 + 2 + 5 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 4691702016 + 129813928209 = 68496^2 + 360297^2 .
It is not a de Polignac number, because 134505630225 - 21 = 134505630223 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134505630225.
It is not an unprimeable number, because it can be changed into a prime (134505630223) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 223917 + ... + 564933.
Almost surely, 2134505630225 is an apocalyptic number.
134505630225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134505630225 is a deficient number, since it is larger than the sum of its proper divisors (106547035291).
134505630225 is a wasteful number, since it uses less digits than its factorization.
134505630225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342786 (or 342778 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 134505630225 in words is "one hundred thirty-four billion, five hundred five million, six hundred thirty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •