Base | Representation |
---|---|
bin | 10101011100111000… |
… | …11000011000000011 |
3 | 1002201121112102000000 |
4 | 22232130120120003 |
5 | 142041223010201 |
6 | 5142440531043 |
7 | 555251366412 |
oct | 125634303003 |
9 | 32647472000 |
10 | 11516610051 |
11 | 497a90a651 |
12 | 2294a80a83 |
13 | 1116c76b7b |
14 | 7b374b479 |
15 | 4760d8d86 |
hex | 2ae718603 |
11516610051 has 14 divisors (see below), whose sum is σ = 17267017260. Its totient is φ = 7677739548.
The previous prime is 11516610031. The next prime is 11516610109. The reversal of 11516610051 is 15001661511.
It is not a de Polignac number, because 11516610051 - 211 = 11516608003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11516609997 and 11516610024.
It is not an unprimeable number, because it can be changed into a prime (11516610031) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 7898181 + ... + 7899638.
Almost surely, 211516610051 is an apocalyptic number.
11516610051 is a deficient number, since it is larger than the sum of its proper divisors (5750407209).
11516610051 is an frugal number, since it uses more digits than its factorization.
11516610051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15797837 (or 15797822 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 11516610051 in words is "eleven billion, five hundred sixteen million, six hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •