Base | Representation |
---|---|
bin | 10001011110101110011… |
… | …010010100100111000011 |
3 | 11020211120020010201101101 |
4 | 101132232122110213003 |
5 | 124140100313330311 |
6 | 2315500032315231 |
7 | 152533254425206 |
oct | 21365632244703 |
9 | 4224506121341 |
10 | 1201222011331 |
11 | 423487567311 |
12 | 17497a9a2b17 |
13 | 89375817c34 |
14 | 421d494793d |
15 | 213a7122ec1 |
hex | 117ae6949c3 |
1201222011331 has 2 divisors, whose sum is σ = 1201222011332. Its totient is φ = 1201222011330.
The previous prime is 1201222011323. The next prime is 1201222011349. The reversal of 1201222011331 is 1331102221021.
It is a weak prime.
It is an emirp because it is prime and its reverse (1331102221021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201222011331 - 23 = 1201222011323 is a prime.
It is a super-3 number, since 3×12012220113313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1201222011299 and 1201222011308.
It is not a weakly prime, because it can be changed into another prime (1201222081331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600611005665 + 600611005666.
It is an arithmetic number, because the mean of its divisors is an integer number (600611005666).
Almost surely, 21201222011331 is an apocalyptic number.
1201222011331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201222011331 is an equidigital number, since it uses as much as digits as its factorization.
1201222011331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1201222011331 its reverse (1331102221021), we get a palindrome (2532324232352).
The spelling of 1201222011331 in words is "one trillion, two hundred one billion, two hundred twenty-two million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •