Base | Representation |
---|---|
bin | 1110101000010010010… |
… | …1100101110110011010 |
3 | 220000201210112102010112 |
4 | 3222010211211312122 |
5 | 13104212113100132 |
6 | 311243252444322 |
7 | 24105153266210 |
oct | 3520445456632 |
9 | 800653472115 |
10 | 251332550042 |
11 | 97653743882 |
12 | 408629196a2 |
13 | 1a915182742 |
14 | c2437a6cb0 |
15 | 680ecd8ab2 |
hex | 3a84965d9a |
251332550042 has 16 divisors (see below), whose sum is σ = 431152363392. Its totient is φ = 107639809200.
The previous prime is 251332550023. The next prime is 251332550047. The reversal of 251332550042 is 240055233152.
251332550042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2513325500422 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 251332549990 and 251332550008.
It is not an unprimeable number, because it can be changed into a prime (251332550047) 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 in 7 ways as a sum of consecutive naturals, for example, 6157334 + ... + 6198017.
It is an arithmetic number, because the mean of its divisors is an integer number (26947022712).
Almost surely, 2251332550042 is an apocalyptic number.
251332550042 is a deficient number, since it is larger than the sum of its proper divisors (179819813350).
251332550042 is a wasteful number, since it uses less digits than its factorization.
251332550042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12356813.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 251332550042 its reverse (240055233152), we get a palindrome (491387783194).
The spelling of 251332550042 in words is "two hundred fifty-one billion, three hundred thirty-two million, five hundred fifty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •