Base | Representation |
---|---|
bin | 1010111010100011001111… |
… | …1100110011001011011111 |
3 | 1120111021201000221122110211 |
4 | 2232220303330303023133 |
5 | 3033111032102420221 |
6 | 41305104334113251 |
7 | 2346021135411565 |
oct | 256506374631337 |
9 | 46437630848424 |
10 | 12001010201311 |
11 | 390766643601a |
12 | 1419a6204b827 |
13 | 6908c8a8c141 |
14 | 2d6bcdc23a35 |
15 | 15c2919696e1 |
hex | aea33f332df |
12001010201311 has 2 divisors, whose sum is σ = 12001010201312. Its totient is φ = 12001010201310.
The previous prime is 12001010201309. The next prime is 12001010201357. The reversal of 12001010201311 is 11310201010021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12001010201311 - 21 = 12001010201309 is a prime.
It is a super-2 number, since 2×120010102013112 (a number of 27 digits) contains 22 as substring.
Together with 12001010201309, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12001010201291 and 12001010201300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001010201381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000505100655 + 6000505100656.
It is an arithmetic number, because the mean of its divisors is an integer number (6000505100656).
Almost surely, 212001010201311 is an apocalyptic number.
12001010201311 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001010201311 is an equidigital number, since it uses as much as digits as its factorization.
12001010201311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 12001010201311 its reverse (11310201010021), we get a palindrome (23311211211332).
The spelling of 12001010201311 in words is "twelve trillion, one billion, ten million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •