Base | Representation |
---|---|
bin | 101111100111101011… |
… | …100111111110111011 |
3 | 11212222110011001222201 |
4 | 233213223213332323 |
5 | 1314204143104430 |
6 | 35253423531031 |
7 | 3460042353232 |
oct | 574753477673 |
9 | 155873131881 |
10 | 51131613115 |
11 | 1a75950a800 |
12 | 9aaba59a77 |
13 | 4a8b33b99b |
14 | 2690b3bb19 |
15 | 14e3dc28ca |
hex | be7ae7fbb |
51131613115 has 48 divisors (see below), whose sum is σ = 70063455168. Its totient is φ = 35767424000.
The previous prime is 51131613109. The next prime is 51131613151.
51131613115 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51131613115 - 23 = 51131613107 is a prime.
It is a super-2 number, since 2×511316131152 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1746639 + ... + 1775671.
It is an arithmetic number, because the mean of its divisors is an integer number (1459655316).
Almost surely, 251131613115 is an apocalyptic number.
51131613115 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51131613115 is a deficient number, since it is larger than the sum of its proper divisors (18931842053).
51131613115 is a wasteful number, since it uses less digits than its factorization.
51131613115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29172 (or 29161 counting only the distinct ones).
The product of its digits is 1350, while the sum is 28.
The spelling of 51131613115 in words is "fifty-one billion, one hundred thirty-one million, six hundred thirteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •