Base | Representation |
---|---|
bin | 101111100111011001… |
… | …101011000000100011 |
3 | 11212222010021222022000 |
4 | 233213121223000203 |
5 | 1314201442010130 |
6 | 35253135015043 |
7 | 3456654352440 |
oct | 574731530043 |
9 | 155863258260 |
10 | 51126906915 |
11 | 1a756895987 |
12 | 9aaa36a483 |
13 | 4a8a381856 |
14 | 26902749c7 |
15 | 14e3793260 |
hex | be766b023 |
51126906915 has 128 divisors (see below), whose sum is σ = 108437821440. Its totient is φ = 22366886400.
The previous prime is 51126906907. The next prime is 51126906967. The reversal of 51126906915 is 51960962115.
It is a happy number.
51126906915 is a `hidden beast` number, since 511 + 2 + 69 + 0 + 69 + 15 = 666.
It is not a de Polignac number, because 51126906915 - 23 = 51126906907 is a prime.
It is a super-2 number, since 2×511269069152 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2120880 + ... + 2144850.
It is an arithmetic number, because the mean of its divisors is an integer number (847170480).
Almost surely, 251126906915 is an apocalyptic number.
51126906915 is an abundant number, since it is smaller than the sum of its proper divisors (57310914525).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51126906915 is a wasteful number, since it uses less digits than its factorization.
51126906915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24090 (or 24084 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 45.
The spelling of 51126906915 in words is "fifty-one billion, one hundred twenty-six million, nine hundred six thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •