Base | Representation |
---|---|
bin | 10001101000110000111… |
… | …001010100100000011001 |
3 | 11021212101102220200000112 |
4 | 101220300321110200121 |
5 | 124324134241010131 |
6 | 2324441410014105 |
7 | 153364342312031 |
oct | 21506071244031 |
9 | 4255342820015 |
10 | 1212001110041 |
11 | 428009036757 |
12 | 176a88877335 |
13 | 8a3a2a4a857 |
14 | 429383548c1 |
15 | 217d85ca02b |
hex | 11a30e54819 |
1212001110041 has 2 divisors, whose sum is σ = 1212001110042. Its totient is φ = 1212001110040.
The previous prime is 1212001110013. The next prime is 1212001110043. The reversal of 1212001110041 is 1400111002121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1196881948441 + 15119161600 = 1094021^2 + 122960^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212001110041 - 210 = 1212001109017 is a prime.
Together with 1212001110043, 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 = 1212001109998 and 1212001110025.
It is not a weakly prime, because it can be changed into another prime (1212001110043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606000555020 + 606000555021.
It is an arithmetic number, because the mean of its divisors is an integer number (606000555021).
Almost surely, 21212001110041 is an apocalyptic number.
It is an amenable number.
1212001110041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212001110041 is an equidigital number, since it uses as much as digits as its factorization.
1212001110041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1212001110041 its reverse (1400111002121), we get a palindrome (2612112112162).
The spelling of 1212001110041 in words is "one trillion, two hundred twelve billion, one million, one hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •