Base | Representation |
---|---|
bin | 10111010001101011101111… |
… | …10001101101100011111100 |
3 | 20201020020210001100022011220 |
4 | 23220311313301231203330 |
5 | 23202104124001134222 |
6 | 300510043140513340 |
7 | 13532001233043165 |
oct | 1350656761554374 |
9 | 221206701308156 |
10 | 51185134786812 |
11 | 15344548214524 |
12 | 58a80320ab850 |
13 | 2273978395140 |
14 | c8d53379676c |
15 | 5db6997acb5c |
hex | 2e8d77c6d8fc |
51185134786812 has 48 divisors (see below), whose sum is σ = 131355632335872. Its totient is φ = 15414181341120.
The previous prime is 51185134786811. The next prime is 51185134786847. The reversal of 51185134786812 is 21868743158115.
It is a super-2 number, since 2×511851347868122 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51185134786811) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3490522864 + ... + 3490537527.
It is an arithmetic number, because the mean of its divisors is an integer number (2736575673664).
Almost surely, 251185134786812 is an apocalyptic number.
51185134786812 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
51185134786812 is an abundant number, since it is smaller than the sum of its proper divisors (80170497549060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51185134786812 is a wasteful number, since it uses less digits than its factorization.
51185134786812 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6981060458 (or 6981060456 counting only the distinct ones).
The product of its digits is 12902400, while the sum is 60.
The spelling of 51185134786812 in words is "fifty-one trillion, one hundred eighty-five billion, one hundred thirty-four million, seven hundred eighty-six thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •