Base | Representation |
---|---|
bin | 11011010010011001111001… |
… | …001110011001001011010111 |
3 | 120201221000222022201022020102 |
4 | 123102121321032121023113 |
5 | 111212234044030013421 |
6 | 1103124431204524315 |
7 | 34164403325413514 |
oct | 3322317116311327 |
9 | 521830868638212 |
10 | 120012010001111 |
11 | 3526a897a36868 |
12 | 1156316b3b069b |
13 | 51c71126836c7 |
14 | 218c88013230b |
15 | dd1bc3bee60b |
hex | 6d26793992d7 |
120012010001111 has 2 divisors, whose sum is σ = 120012010001112. Its totient is φ = 120012010001110.
The previous prime is 120012010001077. The next prime is 120012010001113. The reversal of 120012010001111 is 111100010210021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120012010001111 is a prime.
It is a Sophie Germain prime.
Together with 120012010001113, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 120012010001092 and 120012010001101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120012010001113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60006005000555 + 60006005000556.
It is an arithmetic number, because the mean of its divisors is an integer number (60006005000556).
Almost surely, 2120012010001111 is an apocalyptic number.
120012010001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
120012010001111 is an equidigital number, since it uses as much as digits as its factorization.
120012010001111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 120012010001111 its reverse (111100010210021), we get a palindrome (231112020211132).
The spelling of 120012010001111 in words is "one hundred twenty trillion, twelve billion, ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •