Base | Representation |
---|---|
bin | 111110101100000000… |
… | …0010010011001011000 |
3 | 110212110221010202102200 |
4 | 1331120000102121120 |
5 | 4201200314102121 |
6 | 141502131330200 |
7 | 12504010000056 |
oct | 1753000223130 |
9 | 425427122380 |
10 | 134620456536 |
11 | 52101813555 |
12 | 22110150960 |
13 | c905204c97 |
14 | 6730dad1d6 |
15 | 377d7e7a26 |
hex | 1f58012658 |
134620456536 has 24 divisors (see below), whose sum is σ = 364597069980. Its totient is φ = 44873485488.
The previous prime is 134620456499. The next prime is 134620456541. The reversal of 134620456536 is 635654026431.
134620456536 is a `hidden beast` number, since 1 + 3 + 4 + 62 + 0 + 4 + 56 + 536 = 666.
134620456536 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×1346204565362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134620456491 and 134620456500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 934864210 + ... + 934864353.
Almost surely, 2134620456536 is an apocalyptic number.
It is an amenable number.
134620456536 is an abundant number, since it is smaller than the sum of its proper divisors (229976613444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134620456536 is a wasteful number, since it uses less digits than its factorization.
134620456536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869728575 (or 1869728568 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 45.
The spelling of 134620456536 in words is "one hundred thirty-four billion, six hundred twenty million, four hundred fifty-six thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •