Base | Representation |
---|---|
bin | 10000100001000110010… |
… | …101001110011000100101 |
3 | 11000111202200100002022221 |
4 | 100201012111032120211 |
5 | 122044041120211310 |
6 | 2225234013152341 |
7 | 145001426106124 |
oct | 20410625163045 |
9 | 4014680302287 |
10 | 1135051335205 |
11 | 3a8410984a17 |
12 | 163b9248b6b1 |
13 | 8305b833cc8 |
14 | 3cd18737abb |
15 | 1e7d2cc1ada |
hex | 1084654e625 |
1135051335205 has 4 divisors (see below), whose sum is σ = 1362061602252. Its totient is φ = 908041068160.
The previous prime is 1135051335203. The next prime is 1135051335227. The reversal of 1135051335205 is 5025331505311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 310585519204 + 824465816001 = 557302^2 + 908001^2 .
It is not a de Polignac number, because 1135051335205 - 21 = 1135051335203 is a prime.
It is a super-3 number, since 3×11350513352053 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1135051335203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113505133516 + ... + 113505133525.
It is an arithmetic number, because the mean of its divisors is an integer number (340515400563).
Almost surely, 21135051335205 is an apocalyptic number.
It is an amenable number.
1135051335205 is a deficient number, since it is larger than the sum of its proper divisors (227010267047).
1135051335205 is an equidigital number, since it uses as much as digits as its factorization.
1135051335205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227010267046.
The product of its (nonzero) digits is 33750, while the sum is 34.
The spelling of 1135051335205 in words is "one trillion, one hundred thirty-five billion, fifty-one million, three hundred thirty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •