Base | Representation |
---|---|
bin | 111000111101111000011110… |
… | …010010011101100101011001 |
3 | 1012212002200121112110102111020 |
4 | 320331320132102131211121 |
5 | 230314344312340313423 |
6 | 2244505531500153053 |
7 | 103526100222213054 |
oct | 7075703622354531 |
9 | 1185080545412436 |
10 | 250543130401113 |
11 | 72915821513630 |
12 | 24124b2b538789 |
13 | a9a51675c2914 |
14 | 45c24d068ba9b |
15 | 1de730606a4e3 |
hex | e3de1e49d959 |
250543130401113 has 32 divisors (see below), whose sum is σ = 384446109258240. Its totient is φ = 143537739154560.
The previous prime is 250543130401063. The next prime is 250543130401159. The reversal of 250543130401113 is 311104031345052.
It is not a de Polignac number, because 250543130401113 - 213 = 250543130392921 is a prime.
It is a super-2 number, since 2×2505431304011132 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (250543130401013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 436901995 + ... + 437475072.
It is an arithmetic number, because the mean of its divisors is an integer number (12013940914320).
Almost surely, 2250543130401113 is an apocalyptic number.
It is an amenable number.
250543130401113 is a deficient number, since it is larger than the sum of its proper divisors (133902978857127).
250543130401113 is a wasteful number, since it uses less digits than its factorization.
250543130401113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874377557.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 250543130401113 its reverse (311104031345052), we get a palindrome (561647161746165).
The spelling of 250543130401113 in words is "two hundred fifty trillion, five hundred forty-three billion, one hundred thirty million, four hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •