Base | Representation |
---|---|
bin | 111110111011110100… |
… | …0111111100110010000 |
3 | 110220211220212101120211 |
4 | 1331313220333212100 |
5 | 4203242203034021 |
6 | 142030531413504 |
7 | 12523113265531 |
oct | 1756750774620 |
9 | 426756771524 |
10 | 135151221136 |
11 | 52354382888 |
12 | 22239a54294 |
13 | c98b16c089 |
14 | 6781692688 |
15 | 37b01db3e1 |
hex | 1f77a3f990 |
135151221136 has 10 divisors (see below), whose sum is σ = 261855490982. Its totient is φ = 67575610560.
The previous prime is 135151221119. The next prime is 135151221137. The reversal of 135151221136 is 631122151531.
It can be written as a sum of positive squares in only one way, i.e., 89245587600 + 45905633536 = 298740^2 + 214256^2 .
It is a junction number, because it is equal to n+sod(n) for n = 135151221098 and 135151221107.
It is not an unprimeable number, because it can be changed into a prime (135151221137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4223475645 + ... + 4223475676.
Almost surely, 2135151221136 is an apocalyptic number.
135151221136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
135151221136 is a deficient number, since it is larger than the sum of its proper divisors (126704269846).
135151221136 is an equidigital number, since it uses as much as digits as its factorization.
135151221136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8446951329 (or 8446951323 counting only the distinct ones).
The product of its digits is 5400, while the sum is 31.
Adding to 135151221136 its reverse (631122151531), we get a palindrome (766273372667).
The spelling of 135151221136 in words is "one hundred thirty-five billion, one hundred fifty-one million, two hundred twenty-one thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •