Base | Representation |
---|---|
bin | 101111100111001111… |
… | …111011110000111001 |
3 | 11212221221111021111111 |
4 | 233213033323300321 |
5 | 1314200313312410 |
6 | 35253004200321 |
7 | 3456623561026 |
oct | 574717736071 |
9 | 155857437444 |
10 | 51124354105 |
11 | 1a755401a20 |
12 | 9aa95390a1 |
13 | 4a89999906 |
14 | 268dbac54d |
15 | 14e343bb8a |
hex | be73fbc39 |
51124354105 has 64 divisors (see below), whose sum is σ = 69435325440. Its totient is φ = 35816704000.
The previous prime is 51124354097. The next prime is 51124354111. The reversal of 51124354105 is 50145342115.
It is not a de Polignac number, because 51124354105 - 23 = 51124354097 is a prime.
It is a super-2 number, since 2×511243541052 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 72930255 + ... + 72930955.
It is an arithmetic number, because the mean of its divisors is an integer number (1084926960).
Almost surely, 251124354105 is an apocalyptic number.
51124354105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
51124354105 is a deficient number, since it is larger than the sum of its proper divisors (18310971335).
51124354105 is a wasteful number, since it uses less digits than its factorization.
51124354105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170.
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 51124354105 in words is "fifty-one billion, one hundred twenty-four million, three hundred fifty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •