Base | Representation |
---|---|
bin | 10000001011000… |
… | …10100010011011 |
3 | 100110021202010200 |
4 | 20011202202123 |
5 | 234212414130 |
6 | 21243513243 |
7 | 3235114053 |
oct | 1005424233 |
9 | 313252120 |
10 | 135669915 |
11 | 6a6448a7 |
12 | 39528823 |
13 | 22152474 |
14 | 14038563 |
15 | bd9d760 |
hex | 816289b |
135669915 has 12 divisors (see below), whose sum is σ = 235161264. Its totient is φ = 72357264.
The previous prime is 135669907. The next prime is 135669973. The reversal of 135669915 is 519966531.
It is not a de Polignac number, because 135669915 - 23 = 135669907 is a prime.
It is a super-2 number, since 2×1356699152 = 36812651672214450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45), and also a Moran number because the ratio is a prime number: 3014887 = 135669915 / (1 + 3 + 5 + 6 + 6 + 9 + 9 + 1 + 5).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1507399 + ... + 1507488.
It is an arithmetic number, because the mean of its divisors is an integer number (19596772).
Almost surely, 2135669915 is an apocalyptic number.
135669915 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135669915 is a deficient number, since it is larger than the sum of its proper divisors (99491349).
135669915 is a wasteful number, since it uses less digits than its factorization.
135669915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3014898 (or 3014895 counting only the distinct ones).
The product of its digits is 218700, while the sum is 45.
The square root of 135669915 is about 11647.7429144019. The cubic root of 135669915 is about 513.8399313326.
The spelling of 135669915 in words is "one hundred thirty-five million, six hundred sixty-nine thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •