Base | Representation |
---|---|
bin | 11101011101000000000… |
… | …01010110001011011111 |
3 | 10120202011011100022122111 |
4 | 32232200001112023133 |
5 | 113040040004201421 |
6 | 2052523551254451 |
7 | 133054232154103 |
oct | 16564001261337 |
9 | 3522134308574 |
10 | 1012002022111 |
11 | 360207838833 |
12 | 14417151a427 |
13 | 7457b98a882 |
14 | 36da442d903 |
15 | 1b4d0285ee1 |
hex | eba00562df |
1012002022111 has 16 divisors (see below), whose sum is σ = 1040721671808. Its totient is φ = 983355184800.
The previous prime is 1012002022069. The next prime is 1012002022123. The reversal of 1012002022111 is 1112202002101.
1012002022111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1012002022111 - 223 = 1011993633503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012002022091 and 1012002022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012002082111) 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, 201953596 + ... + 201958606.
It is an arithmetic number, because the mean of its divisors is an integer number (65045104488).
Almost surely, 21012002022111 is an apocalyptic number.
1012002022111 is a deficient number, since it is larger than the sum of its proper divisors (28719649697).
1012002022111 is a wasteful number, since it uses less digits than its factorization.
1012002022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11142.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1012002022111 its reverse (1112202002101), we get a palindrome (2124204024212).
The spelling of 1012002022111 in words is "one trillion, twelve billion, two million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •