Base | Representation |
---|---|
bin | 111110101100010010… |
… | …1101101010010010101 |
3 | 110212111121121010111100 |
4 | 1331120211231102111 |
5 | 4201210322003010 |
6 | 141503121500313 |
7 | 12504156244104 |
oct | 1753045552225 |
9 | 425447533440 |
10 | 134630266005 |
11 | 52107303554 |
12 | 221134a1699 |
13 | c90725abc1 |
14 | 673240403b |
15 | 377e5d42c0 |
hex | 1f5896d495 |
134630266005 has 24 divisors (see below), whose sum is σ = 233773663968. Its totient is φ = 71675258976.
The previous prime is 134630265997. The next prime is 134630266007. The reversal of 134630266005 is 500662036431.
134630266005 is a `hidden beast` number, since 1 + 3 + 46 + 3 + 0 + 2 + 6 + 600 + 5 = 666.
It is not a de Polignac number, because 134630266005 - 23 = 134630265997 is a prime.
It is a super-4 number, since 4×1346302660054 (a number of 46 digits) contains 4444 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134630266007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2631667 + ... + 2682336.
It is an arithmetic number, because the mean of its divisors is an integer number (9740569332).
Almost surely, 2134630266005 is an apocalyptic number.
134630266005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134630266005 is a deficient number, since it is larger than the sum of its proper divisors (99143397963).
134630266005 is a wasteful number, since it uses less digits than its factorization.
134630266005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5314577 (or 5314574 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 134630266005 in words is "one hundred thirty-four billion, six hundred thirty million, two hundred sixty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •