Base | Representation |
---|---|
bin | 10111001110111000011011… |
… | …11101101000111111010101 |
3 | 20200220001022012122001220120 |
4 | 23213130031331220333111 |
5 | 23144020001240422110 |
6 | 300353523013422153 |
7 | 13522022555005233 |
oct | 1347341575507725 |
9 | 220801265561816 |
10 | 51088870248405 |
11 | 15307739409a70 |
12 | 589144733a959 |
13 | 2267876744202 |
14 | c88a008a7953 |
15 | 5d8e13491870 |
hex | 2e770df68fd5 |
51088870248405 has 16 divisors (see below), whose sum is σ = 89173300797504. Its totient is φ = 24770361332480.
The previous prime is 51088870248341. The next prime is 51088870248421. The reversal of 51088870248405 is 50484207888015.
It is a happy number.
It is not a de Polignac number, because 51088870248405 - 26 = 51088870248341 is a prime.
It is a super-2 number, since 2×510888702484052 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 154814758164 + ... + 154814758493.
It is an arithmetic number, because the mean of its divisors is an integer number (5573331299844).
Almost surely, 251088870248405 is an apocalyptic number.
51088870248405 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
51088870248405 is a deficient number, since it is larger than the sum of its proper divisors (38084430549099).
51088870248405 is a wasteful number, since it uses less digits than its factorization.
51088870248405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309629516676.
The product of its (nonzero) digits is 22937600, while the sum is 60.
The spelling of 51088870248405 in words is "fifty-one trillion, eighty-eight billion, eight hundred seventy million, two hundred forty-eight thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •