Base | Representation |
---|---|
bin | 11101011100111111110… |
… | …01101011001101100111 |
3 | 10120202011000120011002000 |
4 | 32232133321223031213 |
5 | 113040034000323421 |
6 | 2052523440220343 |
7 | 133054206110115 |
oct | 16563771531547 |
9 | 3522130504060 |
10 | 1012000011111 |
11 | 360206694951 |
12 | 14417090a6b3 |
13 | 7457b43542b |
14 | 36da4068ab5 |
15 | 1b4ceeda226 |
hex | eb9fe6b367 |
1012000011111 has 16 divisors (see below), whose sum is σ = 1504671775200. Its totient is φ = 672231049344.
The previous prime is 1012000011079. The next prime is 1012000011133. The reversal of 1012000011111 is 1111100002101.
It is not a de Polignac number, because 1012000011111 - 25 = 1012000011079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1012000011093 and 1012000011102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012000011311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67648626 + ... + 67663583.
It is an arithmetic number, because the mean of its divisors is an integer number (94041985950).
Almost surely, 21012000011111 is an apocalyptic number.
1012000011111 is a deficient number, since it is larger than the sum of its proper divisors (492671764089).
1012000011111 is a wasteful number, since it uses less digits than its factorization.
1012000011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135312495 (or 135312489 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1012000011111 its reverse (1111100002101), we get a palindrome (2123100013212).
The spelling of 1012000011111 in words is "one trillion, twelve billion, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •