Base | Representation |
---|---|
bin | 10111001111010100111000… |
… | …01001101001011010110010 |
3 | 20200221111201102121110221010 |
4 | 23213222130021221122302 |
5 | 23144242240002144300 |
6 | 300404530151411350 |
7 | 13523103150251631 |
oct | 1347523411513262 |
9 | 220844642543833 |
10 | 51104140662450 |
11 | 15313165138067 |
12 | 58943a9383b56 |
13 | 226913b2cc675 |
14 | c8964c99d518 |
15 | 5d9508dbda50 |
hex | 2e7a9c2696b2 |
51104140662450 has 48 divisors (see below), whose sum is σ = 126745219054656. Its totient is φ = 13627023508800.
The previous prime is 51104140662431. The next prime is 51104140662577. The reversal of 51104140662450 is 5426604140115.
It is a super-2 number, since 2×511041406624502 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51104140662399 and 51104140662408.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6594606 + ... + 12070505.
It is an arithmetic number, because the mean of its divisors is an integer number (2640525396972).
Almost surely, 251104140662450 is an apocalyptic number.
51104140662450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51104140662450 is an abundant number, since it is smaller than the sum of its proper divisors (75641078392206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51104140662450 is a wasteful number, since it uses less digits than its factorization.
51104140662450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18683379 (or 18683374 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 39.
The spelling of 51104140662450 in words is "fifty-one trillion, one hundred four billion, one hundred forty million, six hundred sixty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •