Base | Representation |
---|---|
bin | 111111001010101010… |
… | …0010010101110000011 |
3 | 110222010121201210222000 |
4 | 1332111110102232003 |
5 | 4210302133022130 |
6 | 142152155115043 |
7 | 12541340263323 |
oct | 1762524225603 |
9 | 428117653860 |
10 | 135649110915 |
11 | 5258a42883a |
12 | 22358742a83 |
13 | ca3a365806 |
14 | 67cb859283 |
15 | 37ddc89260 |
hex | 1f95512b83 |
135649110915 has 16 divisors (see below), whose sum is σ = 241153975200. Its totient is φ = 72346192416.
The previous prime is 135649110893. The next prime is 135649110917. The reversal of 135649110915 is 519011946531.
135649110915 is a `hidden beast` number, since 1 + 3 + 56 + 491 + 109 + 1 + 5 = 666.
It is not a de Polignac number, because 135649110915 - 28 = 135649110659 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (135649110917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 502403980 + ... + 502404249.
It is an arithmetic number, because the mean of its divisors is an integer number (15072123450).
Almost surely, 2135649110915 is an apocalyptic number.
135649110915 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135649110915 is a deficient number, since it is larger than the sum of its proper divisors (105504864285).
135649110915 is a wasteful number, since it uses less digits than its factorization.
135649110915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004808243 (or 1004808237 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 45.
The spelling of 135649110915 in words is "one hundred thirty-five billion, six hundred forty-nine million, one hundred ten thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.962 sec. • engine limits •