Base | Representation |
---|---|
bin | 111000111001100000001110… |
… | …110000001010011111010011 |
3 | 1012211000220220201021220222120 |
4 | 320321200032300022133103 |
5 | 230244432032320303133 |
6 | 2244115404553505323 |
7 | 103465255354312341 |
oct | 7071401660123723 |
9 | 1184026821256876 |
10 | 250242222041043 |
11 | 7280a1485a4a31 |
12 | 24096751a12243 |
13 | a98298153135b |
14 | 45b1b06a54991 |
15 | 1dde593c7cab3 |
hex | e3980ec0a7d3 |
250242222041043 has 16 divisors (see below), whose sum is σ = 334374351442560. Its totient is φ = 166469128001856.
The previous prime is 250242222040933. The next prime is 250242222041051. The reversal of 250242222041043 is 340140222242052.
It is not a de Polignac number, because 250242222041043 - 216 = 250242221975507 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 250242222040995 and 250242222041013.
It is not an unprimeable number, because it can be changed into a prime (250242222041443) 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, 136706823 + ... + 138525231.
It is an arithmetic number, because the mean of its divisors is an integer number (20898396965160).
Almost surely, 2250242222041043 is an apocalyptic number.
250242222041043 is a deficient number, since it is larger than the sum of its proper divisors (84132129401517).
250242222041043 is a wasteful number, since it uses less digits than its factorization.
250242222041043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1917106.
The product of its (nonzero) digits is 61440, while the sum is 33.
Adding to 250242222041043 its reverse (340140222242052), we get a palindrome (590382444283095).
The spelling of 250242222041043 in words is "two hundred fifty trillion, two hundred forty-two billion, two hundred twenty-two million, forty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •