Base | Representation |
---|---|
bin | 10111011001011111010100… |
… | …01111010000000011100010 |
3 | 20202011220001221121120111112 |
4 | 23230233222033100003202 |
5 | 23221002421313332000 |
6 | 301233201155543322 |
7 | 13560244544116352 |
oct | 1354575217200342 |
9 | 222156057546445 |
10 | 51453343105250 |
11 | 15438270884929 |
12 | 59300045bab42 |
13 | 229304c891c48 |
14 | c9c4d8540b62 |
15 | 5e3645dce235 |
hex | 2ecbea3d00e2 |
51453343105250 has 128 divisors (see below), whose sum is σ = 101915167161600. Its totient is φ = 19397409292800.
The previous prime is 51453343105189. The next prime is 51453343105271. The reversal of 51453343105250 is 5250134335415.
51453343105250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 51453343105198 and 51453343105207.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 714663254 + ... + 714735246.
It is an arithmetic number, because the mean of its divisors is an integer number (796212243450).
Almost surely, 251453343105250 is an apocalyptic number.
51453343105250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51453343105250 is a deficient number, since it is larger than the sum of its proper divisors (50461824056350).
51453343105250 is a wasteful number, since it uses less digits than its factorization.
51453343105250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72805 (or 72795 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 51453343105250 in words is "fifty-one trillion, four hundred fifty-three billion, three hundred forty-three million, one hundred five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •