Base | Representation |
---|---|
bin | 111111000000011000… |
… | …0010011010000111101 |
3 | 110221020120121001101000 |
4 | 1332000300103100331 |
5 | 4204100324203040 |
6 | 142054033040513 |
7 | 12526651100004 |
oct | 1760060232075 |
9 | 427216531330 |
10 | 135304131645 |
11 | 52422722801 |
12 | 222810b6139 |
13 | c9b3a49977 |
14 | 6797ad7c3b |
15 | 37bd843130 |
hex | 1f80c1343d |
135304131645 has 64 divisors (see below), whose sum is σ = 245209006080. Its totient is φ = 70772385600.
The previous prime is 135304131643. The next prime is 135304131649. The reversal of 135304131645 is 546131403531.
135304131645 is a `hidden beast` number, since 1 + 3 + 5 + 3 + 0 + 4 + 1 + 3 + 1 + 645 = 666.
It is not a de Polignac number, because 135304131645 - 21 = 135304131643 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135304131643) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1793782 + ... + 1867688.
It is an arithmetic number, because the mean of its divisors is an integer number (3831390720).
Almost surely, 2135304131645 is an apocalyptic number.
135304131645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135304131645 is a deficient number, since it is larger than the sum of its proper divisors (109904874435).
135304131645 is a wasteful number, since it uses less digits than its factorization.
135304131645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74183 (or 74177 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 135304131645 in words is "one hundred thirty-five billion, three hundred four million, one hundred thirty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •