Base | Representation |
---|---|
bin | 1111111110110… |
… | …01101100111101 |
3 | 100100020222221002 |
4 | 13333121230331 |
5 | 233304421421 |
6 | 21145220045 |
7 | 3215332664 |
oct | 777315475 |
9 | 310228832 |
10 | 134060861 |
11 | 69745a00 |
12 | 38a91625 |
13 | 21a0ac6c |
14 | 13b39ddb |
15 | bb81b0b |
hex | 7fd9b3d |
134060861 has 12 divisors (see below), whose sum is σ = 156026556. Its totient is φ = 114702720.
The previous prime is 134060837. The next prime is 134060869. The reversal of 134060861 is 168060431.
It can be written as a sum of positive squares in 2 ways, for example, as 37136836 + 96924025 = 6094^2 + 9845^2 .
It is a de Polignac number, because none of the positive numbers 2k-134060861 is a prime.
It is a super-2 number, since 2×1340608612 = 35944628904122642, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134060869) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30530 + ... + 34643.
It is an arithmetic number, because the mean of its divisors is an integer number (13002213).
Almost surely, 2134060861 is an apocalyptic number.
134060861 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134060861 is a deficient number, since it is larger than the sum of its proper divisors (21965695).
134060861 is a wasteful number, since it uses less digits than its factorization.
134060861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65212 (or 65201 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 134060861 is about 11578.4653991796. The cubic root of 134060861 is about 511.8004555353.
The spelling of 134060861 in words is "one hundred thirty-four million, sixty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •