Base | Representation |
---|---|
bin | 10010101001011010… |
… | …11011110011101011 |
3 | 221211200201011010220 |
4 | 21110231123303223 |
5 | 131000322143430 |
6 | 4333221141123 |
7 | 503041132116 |
oct | 112455336353 |
9 | 27750634126 |
10 | 10011131115 |
11 | 4278027a87 |
12 | 1b3485a7a3 |
13 | c370b6b2b |
14 | 6ad81d57d |
15 | 3d8d5b110 |
hex | 254b5bceb |
10011131115 has 16 divisors (see below), whose sum is σ = 16052870688. Its totient is φ = 5327582976.
The previous prime is 10011131099. The next prime is 10011131149. The reversal of 10011131115 is 51113111001.
10011131115 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10011131115 - 24 = 10011131099 is a prime.
It is a super-2 number, since 2×100111311152 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 10011131094 and 10011131103.
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, 723352 + ... + 737061.
It is an arithmetic number, because the mean of its divisors is an integer number (1003304418).
Almost surely, 210011131115 is an apocalyptic number.
10011131115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10011131115 is a deficient number, since it is larger than the sum of its proper divisors (6041739573).
10011131115 is a wasteful number, since it uses less digits than its factorization.
10011131115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1460878.
The product of its (nonzero) digits is 15, while the sum is 15.
Adding to 10011131115 its reverse (51113111001), we get a palindrome (61124242116).
The spelling of 10011131115 in words is "ten billion, eleven million, one hundred thirty-one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •