Base | Representation |
---|---|
bin | 11111000100011000100… |
… | …110010001111101000001 |
3 | 21120002211121200100001212 |
4 | 133010120212101331001 |
5 | 234440000411344210 |
6 | 4312451040335505 |
7 | 310151400522041 |
oct | 37043046217501 |
9 | 7502747610055 |
10 | 2135011434305 |
11 | 7534a9327762 |
12 | 2a5943014595 |
13 | 12643b76c139 |
14 | 75499755721 |
15 | 3a80aca5805 |
hex | 1f118991f41 |
2135011434305 has 8 divisors (see below), whose sum is σ = 2573300126592. Its totient is φ = 1700484877168.
The previous prime is 2135011434253. The next prime is 2135011434329. The reversal of 2135011434305 is 5034341105312.
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 2135011434305 - 222 = 2135007240001 is a prime.
It is a super-2 number, since 2×21350114343052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 940532537 + ... + 940534806.
It is an arithmetic number, because the mean of its divisors is an integer number (321662515824).
Almost surely, 22135011434305 is an apocalyptic number.
It is an amenable number.
2135011434305 is a deficient number, since it is larger than the sum of its proper divisors (438288692287).
2135011434305 is a wasteful number, since it uses less digits than its factorization.
2135011434305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1881067575.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 2135011434305 its reverse (5034341105312), we get a palindrome (7169352539617).
The spelling of 2135011434305 in words is "two trillion, one hundred thirty-five billion, eleven million, four hundred thirty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •