Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10000010100101111111 |
3 | 10120120022000000012112100 |
4 | 32230233312002211333 |
5 | 113022211210310421 |
6 | 2052013121240143 |
7 | 132656500263462 |
oct | 16545766024577 |
9 | 3516260005470 |
10 | 1010120010111 |
11 | 35a431459313 |
12 | 143927193053 |
13 | 7433bab46c4 |
14 | 36c664c92d9 |
15 | 1b41ee2cc26 |
hex | eb2fd8297f |
1010120010111 has 6 divisors (see below), whose sum is σ = 1459062236840. Its totient is φ = 673413340068.
The previous prime is 1010120010103. The next prime is 1010120010143. The reversal of 1010120010111 is 1110100210101.
It is not a de Polignac number, because 1010120010111 - 23 = 1010120010103 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: 112235556679 = 1010120010111 / (1 + 0 + 1 + 0 + 1 + 2 + 0 + 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 = 1010120010093 and 1010120010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010120010811) 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, 56117778331 + ... + 56117778348.
Almost surely, 21010120010111 is an apocalyptic number.
1010120010111 is a deficient number, since it is larger than the sum of its proper divisors (448942226729).
1010120010111 is a wasteful number, since it uses less digits than its factorization.
1010120010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112235556685 (or 112235556682 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010120010111 its reverse (1110100210101), we get a palindrome (2120220220212).
The spelling of 1010120010111 in words is "one trillion, ten billion, one hundred twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •