Base | Representation |
---|---|
bin | 111111001010010001… |
… | …1100000011011111101 |
3 | 110222002201200001221011 |
4 | 1332110203200123331 |
5 | 4210240344301140 |
6 | 142151021035221 |
7 | 12541123500100 |
oct | 1762443403375 |
9 | 428081601834 |
10 | 135636322045 |
11 | 52583193324 |
12 | 223543b5b11 |
13 | ca37808733 |
14 | 67c9c8a737 |
15 | 37dcaaecea |
hex | 1f948e06fd |
135636322045 has 24 divisors (see below), whose sum is σ = 190383357528. Its totient is φ = 92493878400.
The previous prime is 135636322013. The next prime is 135636322049. The reversal of 135636322045 is 540223636531.
It can be written as a sum of positive squares in 4 ways, for example, as 3125033604 + 132511288441 = 55902^2 + 364021^2 .
It is not a de Polignac number, because 135636322045 - 25 = 135636322013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135636321989 and 135636322007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135636322049) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1484986 + ... + 1573675.
It is an arithmetic number, because the mean of its divisors is an integer number (7932639897).
Almost surely, 2135636322045 is an apocalyptic number.
It is an amenable number.
135636322045 is a deficient number, since it is larger than the sum of its proper divisors (54747035483).
135636322045 is a wasteful number, since it uses less digits than its factorization.
135636322045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3058861 (or 3058854 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 40.
Adding to 135636322045 its reverse (540223636531), we get a palindrome (675859958576).
The spelling of 135636322045 in words is "one hundred thirty-five billion, six hundred thirty-six million, three hundred twenty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •