Base | Representation |
---|---|
bin | 11110111111111011000… |
… | …101110101001100010011 |
3 | 21112122110210102110112221 |
4 | 132333323011311030103 |
5 | 234400143140440311 |
6 | 4310335450001511 |
7 | 306621605215453 |
oct | 36777305651423 |
9 | 7478423373487 |
10 | 2130221421331 |
11 | 751470504053 |
12 | 2a4a26a16297 |
13 | 125b57283533 |
14 | 75163515d63 |
15 | 3a62a4cc671 |
hex | 1effb175313 |
2130221421331 has 2 divisors, whose sum is σ = 2130221421332. Its totient is φ = 2130221421330.
The previous prime is 2130221421323. The next prime is 2130221421359. The reversal of 2130221421331 is 1331241220312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2130221421331 - 23 = 2130221421323 is a prime.
It is a super-2 number, since 2×21302214213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2130221421296 and 2130221421305.
It is not a weakly prime, because it can be changed into another prime (2130221421311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065110710665 + 1065110710666.
It is an arithmetic number, because the mean of its divisors is an integer number (1065110710666).
Almost surely, 22130221421331 is an apocalyptic number.
2130221421331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130221421331 is an equidigital number, since it uses as much as digits as its factorization.
2130221421331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 2130221421331 its reverse (1331241220312), we get a palindrome (3461462641643).
It can be divided in two parts, 2130221 and 421331, that added together give a palindrome (2551552).
The spelling of 2130221421331 in words is "two trillion, one hundred thirty billion, two hundred twenty-one million, four hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •