Base | Representation |
---|---|
bin | 11000011011000000… |
… | …11001110100010011 |
3 | 1020211202121012210000 |
4 | 30031200121310103 |
5 | 203323021000201 |
6 | 10005012541043 |
7 | 642625624446 |
oct | 141540316423 |
9 | 36752535700 |
10 | 13111500051 |
11 | 5619111061 |
12 | 265b021783 |
13 | 130c510a70 |
14 | 8c54b165d |
15 | 51b128d86 |
hex | 30d819d13 |
13111500051 has 40 divisors (see below), whose sum is σ = 21297916640. Its totient is φ = 7990213248.
The previous prime is 13111500043. The next prime is 13111500139. The reversal of 13111500051 is 15000511131.
13111500051 is a `hidden beast` number, since 1 + 3 + 111 + 500 + 0 + 51 = 666.
It is not a de Polignac number, because 13111500051 - 23 = 13111500043 is a prime.
It is a super-2 number, since 2×131115000512 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13111499997 and 13111500033.
It is not an unprimeable number, because it can be changed into a prime (13111500041) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 48015 + ... + 168903.
It is an arithmetic number, because the mean of its divisors is an integer number (532447916).
Almost surely, 213111500051 is an apocalyptic number.
13111500051 is a deficient number, since it is larger than the sum of its proper divisors (8186416589).
13111500051 is a wasteful number, since it uses less digits than its factorization.
13111500051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121017 (or 121008 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 18.
The spelling of 13111500051 in words is "thirteen billion, one hundred eleven million, five hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •