Base | Representation |
---|---|
bin | 10000000111100… |
… | …10101010000101 |
3 | 100102102110112000 |
4 | 20003302222011 |
5 | 234103233103 |
6 | 21230015513 |
7 | 3231165033 |
oct | 1003625205 |
9 | 312373460 |
10 | 135211653 |
11 | 6a361575 |
12 | 39347599 |
13 | 220219c5 |
14 | 13d59553 |
15 | bd0caa3 |
hex | 80f2a85 |
135211653 has 16 divisors (see below), whose sum is σ = 205728960. Its totient is φ = 87704208.
The previous prime is 135211649. The next prime is 135211669. The reversal of 135211653 is 356112531.
135211653 is a `hidden beast` number, since 1 + 3 + 5 + 2 + 1 + 1 + 653 = 666.
It is not a de Polignac number, because 135211653 - 22 = 135211649 is a prime.
It is a super-2 number, since 2×1352116532 = 36564382213984818, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135211613) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 66675 + ... + 68672.
It is an arithmetic number, because the mean of its divisors is an integer number (12858060).
Almost surely, 2135211653 is an apocalyptic number.
It is an amenable number.
135211653 is a deficient number, since it is larger than the sum of its proper divisors (70517307).
135211653 is a wasteful number, since it uses less digits than its factorization.
135211653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135393 (or 135387 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 135211653 is about 11628.0545664354. The cubic root of 135211653 is about 513.2607340500.
The spelling of 135211653 in words is "one hundred thirty-five million, two hundred eleven thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •