Base | Representation |
---|---|
bin | 1110100100100110010… |
… | …0100011011000011111 |
3 | 212221011210102200212022 |
4 | 3221021210203120133 |
5 | 13100200130001142 |
6 | 311001122530355 |
7 | 24041501322524 |
oct | 3511144433037 |
9 | 787153380768 |
10 | 250342422047 |
11 | 97195852a83 |
12 | 406272069bb |
13 | 1a7b7cc0aa3 |
14 | c18c0a914b |
15 | 67a2e076d2 |
hex | 3a4992361f |
250342422047 has 2 divisors, whose sum is σ = 250342422048. Its totient is φ = 250342422046.
The previous prime is 250342422037. The next prime is 250342422061. The reversal of 250342422047 is 740224243052.
250342422047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 250342422047 - 26 = 250342421983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 250342421998 and 250342422016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (250342422007) by changing a digit.
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 as a sum of consecutive naturals, namely, 125171211023 + 125171211024.
It is an arithmetic number, because the mean of its divisors is an integer number (125171211024).
Almost surely, 2250342422047 is an apocalyptic number.
250342422047 is a deficient number, since it is larger than the sum of its proper divisors (1).
250342422047 is an equidigital number, since it uses as much as digits as its factorization.
250342422047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 107520, while the sum is 35.
Adding to 250342422047 its reverse (740224243052), we get a palindrome (990566665099).
The spelling of 250342422047 in words is "two hundred fifty billion, three hundred forty-two million, four hundred twenty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •