Base | Representation |
---|---|
bin | 10110010111110101… |
… | …10010110000100101 |
3 | 1011000002001012110022 |
4 | 23023322302300211 |
5 | 144044321343301 |
6 | 5303504004525 |
7 | 603434564345 |
oct | 131372626045 |
9 | 34002035408 |
10 | 12011121701 |
11 | 5103a68567 |
12 | 23b2600745 |
13 | 1195559b07 |
14 | 81d2b4d25 |
15 | 4a471ad1b |
hex | 2cbeb2c25 |
12011121701 has 2 divisors, whose sum is σ = 12011121702. Its totient is φ = 12011121700.
The previous prime is 12011121679. The next prime is 12011121721. The reversal of 12011121701 is 10712111021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11406453601 + 604668100 = 106801^2 + 24590^2 .
It is an emirp because it is prime and its reverse (10712111021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12011121701 - 26 = 12011121637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12011121701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011121721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005560850 + 6005560851.
It is an arithmetic number, because the mean of its divisors is an integer number (6005560851).
Almost surely, 212011121701 is an apocalyptic number.
It is an amenable number.
12011121701 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011121701 is an equidigital number, since it uses as much as digits as its factorization.
12011121701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 12011121701 its reverse (10712111021), we get a palindrome (22723232722).
The spelling of 12011121701 in words is "twelve billion, eleven million, one hundred twenty-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •