Base | Representation |
---|---|
bin | 11110110011111100111010… |
… | …110101010100000000011001 |
3 | 122202210202212110000100001200 |
4 | 132303330322311110000121 |
5 | 120230210023023211301 |
6 | 1200113042423104413 |
7 | 40354245205420023 |
oct | 3663747265240031 |
9 | 582722773010050 |
10 | 135511500210201 |
11 | 3a1a6117100335 |
12 | 132470532a2109 |
13 | 5a7c8ab21b50b |
14 | 2566b12247013 |
15 | 109ee72347c86 |
hex | 7b3f3ad54019 |
135511500210201 has 12 divisors (see below), whose sum is σ = 195833714339328. Its totient is φ = 90297209046744.
The previous prime is 135511500210187. The next prime is 135511500210217. The reversal of 135511500210201 is 102012005115531.
It is a happy number.
135511500210201 is a `hidden beast` number, since 1 + 3 + 5 + 51 + 1 + 500 + 2 + 102 + 0 + 1 = 666.
It is not a de Polignac number, because 135511500210201 - 213 = 135511500202009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (135511500214201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3649238185 + ... + 3649275318.
It is an arithmetic number, because the mean of its divisors is an integer number (16319476194944).
Almost surely, 2135511500210201 is an apocalyptic number.
It is an amenable number.
135511500210201 is a deficient number, since it is larger than the sum of its proper divisors (60322214129127).
135511500210201 is a wasteful number, since it uses less digits than its factorization.
135511500210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7298515572 (or 7298515569 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
Adding to 135511500210201 its reverse (102012005115531), we get a palindrome (237523505325732).
The spelling of 135511500210201 in words is "one hundred thirty-five trillion, five hundred eleven billion, five hundred million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •