Base | Representation |
---|---|
bin | 10110010111110100… |
… | …10111100000111111 |
3 | 1011000001211112101100 |
4 | 23023322113200333 |
5 | 144044304310421 |
6 | 5303501344143 |
7 | 603433621122 |
oct | 131372274077 |
9 | 34001745340 |
10 | 12011010111 |
11 | 51039a1741 |
12 | 23b2568053 |
13 | 119551b099 |
14 | 81d2863b9 |
15 | 4a46e7c26 |
hex | 2cbe9783f |
12011010111 has 6 divisors (see below), whose sum is σ = 17349236840. Its totient is φ = 8007340068.
The previous prime is 12011010107. The next prime is 12011010133. The reversal of 12011010111 is 11101011021.
It is not a de Polignac number, because 12011010111 - 22 = 12011010107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1334556679 = 12011010111 / (1 + 2 + 0 + 1 + 1 + 0 + 1 + 0 + 1 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12011010093 and 12011010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011010161) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 667278331 + ... + 667278348.
Almost surely, 212011010111 is an apocalyptic number.
12011010111 is a deficient number, since it is larger than the sum of its proper divisors (5338226729).
12011010111 is a wasteful number, since it uses less digits than its factorization.
12011010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334556685 (or 1334556682 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 12011010111 its reverse (11101011021), we get a palindrome (23112021132).
The spelling of 12011010111 in words is "twelve billion, eleven million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •