Base | Representation |
---|---|
bin | 111111010010011010… |
… | …0000100011010001010 |
3 | 110222210201221120202202 |
4 | 1332210310010122022 |
5 | 4211320212133041 |
6 | 142234043400202 |
7 | 12550645165442 |
oct | 1764464043212 |
9 | 428721846682 |
10 | 135909099146 |
11 | 52703163847 |
12 | 2240b823062 |
13 | ca7c1945c2 |
14 | 68141b5122 |
15 | 38069e2a9b |
hex | 1fa4d0468a |
135909099146 has 8 divisors (see below), whose sum is σ = 203869197444. Its totient is φ = 67952700000.
The previous prime is 135909099143. The next prime is 135909099163. The reversal of 135909099146 is 641990909531.
It can be written as a sum of positive squares in 2 ways, for example, as 135655939225 + 253159921 = 368315^2 + 15911^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 135909099091 and 135909099100.
It is not an unprimeable number, because it can be changed into a prime (135909099143) 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 3 ways as a sum of consecutive naturals, for example, 831035 + ... + 981038.
Almost surely, 2135909099146 is an apocalyptic number.
135909099146 is a deficient number, since it is larger than the sum of its proper divisors (67960098298).
135909099146 is a wasteful number, since it uses less digits than its factorization.
135909099146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1849576.
The product of its (nonzero) digits is 2361960, while the sum is 56.
The spelling of 135909099146 in words is "one hundred thirty-five billion, nine hundred nine million, ninety-nine thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •