Base | Representation |
---|---|
bin | 11111000100100110111… |
… | …001111000010011001111 |
3 | 21120010110100022120000011 |
4 | 133010212321320103033 |
5 | 234440443333000020 |
6 | 4312530533014051 |
7 | 310160343613303 |
oct | 37044671702317 |
9 | 7503410276004 |
10 | 2135251453135 |
11 | 753611863429 |
12 | 2a59ab484327 |
13 | 1264793c8708 |
14 | 754bd593d03 |
15 | 3a821db735a |
hex | 1f126e784cf |
2135251453135 has 16 divisors (see below), whose sum is σ = 2779196730912. Its totient is φ = 1568506086400.
The previous prime is 2135251453133. The next prime is 2135251453193. The reversal of 2135251453135 is 5313541525312.
It is not a de Polignac number, because 2135251453135 - 21 = 2135251453133 is a prime.
It is a super-3 number, since 3×21352514531353 (a number of 38 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 (2135251453133) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 306345361 + ... + 306352330.
It is an arithmetic number, because the mean of its divisors is an integer number (173699795682).
Almost surely, 22135251453135 is an apocalyptic number.
2135251453135 is a deficient number, since it is larger than the sum of its proper divisors (643945277777).
2135251453135 is a wasteful number, since it uses less digits than its factorization.
2135251453135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612697754.
The product of its digits is 270000, while the sum is 40.
Adding to 2135251453135 its reverse (5313541525312), we get a palindrome (7448792978447).
The spelling of 2135251453135 in words is "two trillion, one hundred thirty-five billion, two hundred fifty-one million, four hundred fifty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •