Base | Representation |
---|---|
bin | 10000100001010000101… |
… | …101000110001101011101 |
3 | 11000112012210210201210112 |
4 | 100201100231012031131 |
5 | 122044420143142331 |
6 | 2225303151215405 |
7 | 145005641251454 |
oct | 20412055061535 |
9 | 4015183721715 |
10 | 1135225365341 |
11 | 3a84a013a381 |
12 | 164020817565 |
13 | 830888c7812 |
14 | 3cd338b9b9b |
15 | 1e7e31eb32b |
hex | 10850b4635d |
1135225365341 has 8 divisors (see below), whose sum is σ = 1194989640000. Its totient is φ = 1075462647840.
The previous prime is 1135225365331. The next prime is 1135225365343. The reversal of 1135225365341 is 1435635225311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1135225365341 - 26 = 1135225365277 is a prime.
It is a super-2 number, since 2×11352253653412 (a number of 25 digits) contains 22 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 (1135225365343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1293785 + ... + 1986033.
It is an arithmetic number, because the mean of its divisors is an integer number (149373705000).
Almost surely, 21135225365341 is an apocalyptic number.
It is an amenable number.
1135225365341 is a deficient number, since it is larger than the sum of its proper divisors (59764274659).
1135225365341 is an equidigital number, since it uses as much as digits as its factorization.
1135225365341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778579.
The product of its digits is 324000, while the sum is 41.
The spelling of 1135225365341 in words is "one trillion, one hundred thirty-five billion, two hundred twenty-five million, three hundred sixty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •