Base | Representation |
---|---|
bin | 111110101100101000… |
… | …0000010010010111001 |
3 | 110212112101110212111000 |
4 | 1331121100002102321 |
5 | 4201221142041410 |
6 | 141504155355213 |
7 | 12504352460205 |
oct | 1753120022271 |
9 | 425471425430 |
10 | 134641362105 |
11 | 521125a2188 |
12 | 22117152b09 |
13 | c909644643 |
14 | 6733a91b05 |
15 | 3780576dc0 |
hex | 1f594024b9 |
134641362105 has 32 divisors (see below), whose sum is σ = 241109625600. Its totient is φ = 71284565376.
The previous prime is 134641362071. The next prime is 134641362113. The reversal of 134641362105 is 501263146431.
134641362105 is a `hidden beast` number, since 1 + 3 + 4 + 641 + 3 + 6 + 2 + 1 + 0 + 5 = 666.
It is not a de Polignac number, because 134641362105 - 210 = 134641361081 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134641362105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3621445 + ... + 3658434.
It is an arithmetic number, because the mean of its divisors is an integer number (7534675800).
Almost surely, 2134641362105 is an apocalyptic number.
134641362105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134641362105 is a deficient number, since it is larger than the sum of its proper divisors (106468263495).
134641362105 is a wasteful number, since it uses less digits than its factorization.
134641362105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7280030 (or 7280024 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 134641362105 in words is "one hundred thirty-four billion, six hundred forty-one million, three hundred sixty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •