Base | Representation |
---|---|
bin | 101111100110100000… |
… | …110110111011001011 |
3 | 11212221002021022101121 |
4 | 233212200312323023 |
5 | 1314134133413030 |
6 | 35251443500111 |
7 | 3456413642443 |
oct | 574640667313 |
9 | 155832238347 |
10 | 51112013515 |
11 | 1a749443292 |
12 | 9aa5387637 |
13 | 4a872688a4 |
14 | 268c2b9123 |
15 | 14e230047a |
hex | be6836ecb |
51112013515 has 16 divisors (see below), whose sum is σ = 61996386816. Its totient is φ = 40450665600.
The previous prime is 51112013507. The next prime is 51112013531. The reversal of 51112013515 is 51531021115.
It is not a de Polignac number, because 51112013515 - 23 = 51112013507 is a prime.
It is a super-2 number, since 2×511120135152 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51112013515.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25009 + ... + 320701.
It is an arithmetic number, because the mean of its divisors is an integer number (3874774176).
Almost surely, 251112013515 is an apocalyptic number.
51112013515 is a deficient number, since it is larger than the sum of its proper divisors (10884373301).
51112013515 is a wasteful number, since it uses less digits than its factorization.
51112013515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296070.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 51112013515 in words is "fifty-one billion, one hundred twelve million, thirteen thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •