Base | Representation |
---|---|
bin | 1001100101101100101010… |
… | …1100010000110010101101 |
3 | 1101022220222020121010212110 |
4 | 2121123022230100302231 |
5 | 2340220034042021013 |
6 | 34231300301154233 |
7 | 2135503400160432 |
oct | 231331254206255 |
9 | 41286866533773 |
10 | 10543250345133 |
11 | 33a5404a59a00 |
12 | 122342925b979 |
13 | 5b62bb87389c |
14 | 286420491b89 |
15 | 1343c2aa32c3 |
hex | 996cab10cad |
10543250345133 has 24 divisors (see below), whose sum is σ = 15950261625088. Its totient is φ = 6183724536000.
The previous prime is 10543250345123. The next prime is 10543250345153. The reversal of 10543250345133 is 33154305234501.
It is a de Polignac number, because none of the positive numbers 2k-10543250345133 is a prime.
It is a super-2 number, since 2×105432503451332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10543250345091 and 10543250345100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10543250345123) 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, 468452728 + ... + 468475233.
Almost surely, 210543250345133 is an apocalyptic number.
It is an amenable number.
10543250345133 is a deficient number, since it is larger than the sum of its proper divisors (5407011279955).
10543250345133 is a wasteful number, since it uses less digits than its factorization.
10543250345133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936928017 (or 936928006 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 39.
Adding to 10543250345133 its reverse (33154305234501), we get a palindrome (43697555579634).
The spelling of 10543250345133 in words is "ten trillion, five hundred forty-three billion, two hundred fifty million, three hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •