Base | Representation |
---|---|
bin | 111110110111111010… |
… | …0110111000100110001 |
3 | 110220111210011110201022 |
4 | 1331233310313010301 |
5 | 4203010122123400 |
6 | 142005525345225 |
7 | 12516632014613 |
oct | 1755764670461 |
9 | 426453143638 |
10 | 135020114225 |
11 | 52297375267 |
12 | 22201b68215 |
13 | c969c56819 |
14 | 676c0c4db3 |
15 | 37a393eb85 |
hex | 1f6fd37131 |
135020114225 has 12 divisors (see below), whose sum is σ = 170583904476. Its totient is φ = 105978050880.
The previous prime is 135020114213. The next prime is 135020114233. The reversal of 135020114225 is 522411020531.
It can be written as a sum of positive squares in 6 ways, for example, as 2119037089 + 132901077136 = 46033^2 + 364556^2 .
It is not a de Polignac number, because 135020114225 - 26 = 135020114161 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135020114194 and 135020114203.
It is an unprimeable number.
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 in 11 ways as a sum of consecutive naturals, for example, 50949662 + ... + 50952311.
It is an arithmetic number, because the mean of its divisors is an integer number (14215325373).
Almost surely, 2135020114225 is an apocalyptic number.
It is an amenable number.
135020114225 is a deficient number, since it is larger than the sum of its proper divisors (35563790251).
135020114225 is a wasteful number, since it uses less digits than its factorization.
135020114225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101902036 (or 101902031 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 135020114225 its reverse (522411020531), we get a palindrome (657431134756).
The spelling of 135020114225 in words is "one hundred thirty-five billion, twenty million, one hundred fourteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •