Base | Representation |
---|---|
bin | 100000010100110001000… |
… | …000011110101100010011 |
3 | 21212100121122001001122112 |
4 | 200110301000132230103 |
5 | 242343230444120311 |
6 | 4420243243055535 |
7 | 316325250012005 |
oct | 40246100365423 |
9 | 7770548031575 |
10 | 2221320301331 |
11 | 787069444a2a |
12 | 2ba60b8115ab |
13 | 131614953761 |
14 | 79726340375 |
15 | 3cbad06d28b |
hex | 2053101eb13 |
2221320301331 has 2 divisors, whose sum is σ = 2221320301332. Its totient is φ = 2221320301330.
The previous prime is 2221320301289. The next prime is 2221320301373. The reversal of 2221320301331 is 1331030231222.
It is a balanced prime because it is at equal distance from previous prime (2221320301289) and next prime (2221320301373).
It is a cyclic number.
It is not a de Polignac number, because 2221320301331 - 218 = 2221320039187 is a prime.
It is a super-2 number, since 2×22213203013312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2221320301297 and 2221320301306.
It is not a weakly prime, because it can be changed into another prime (2221320301381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110660150665 + 1110660150666.
It is an arithmetic number, because the mean of its divisors is an integer number (1110660150666).
Almost surely, 22221320301331 is an apocalyptic number.
2221320301331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221320301331 is an equidigital number, since it uses as much as digits as its factorization.
2221320301331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2221320301331 its reverse (1331030231222), we get a palindrome (3552350532553).
The spelling of 2221320301331 in words is "two trillion, two hundred twenty-one billion, three hundred twenty million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •