Base | Representation |
---|---|
bin | 10111001111100011010011… |
… | …00100111000000101100110 |
3 | 20200222020200221111002201012 |
4 | 23213301221210320011212 |
5 | 23144404113304100443 |
6 | 300412250253302222 |
7 | 13523466041333642 |
oct | 1347615144700546 |
9 | 220866627432635 |
10 | 51111882096998 |
11 | 15316477a61458 |
12 | 58959a9a94972 |
13 | 2269aa30c1478 |
14 | c89b84b9bc22 |
15 | 5d980d842118 |
hex | 2e7c69938166 |
51111882096998 has 32 divisors (see below), whose sum is σ = 77858468835840. Its totient is φ = 25160093521920.
The previous prime is 51111882096997. The next prime is 51111882097009. The reversal of 51111882096998 is 89969028811115.
51111882096998 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-3 number, since 3×511118820969983 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51111882096997) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1046856815 + ... + 1046905637.
It is an arithmetic number, because the mean of its divisors is an integer number (2433077151120).
Almost surely, 251111882096998 is an apocalyptic number.
51111882096998 is a deficient number, since it is larger than the sum of its proper divisors (26746586738842).
51111882096998 is a wasteful number, since it uses less digits than its factorization.
51111882096998 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59252.
The product of its (nonzero) digits is 22394880, while the sum is 68.
The spelling of 51111882096998 in words is "fifty-one trillion, one hundred eleven billion, eight hundred eighty-two million, ninety-six thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •