Base | Representation |
---|---|
bin | 11101100110111111000101… |
… | …001010100010111000111001 |
3 | 122002002010211102222012200111 |
4 | 131212333011022202320321 |
5 | 114032031004324321241 |
6 | 1140543204322504321 |
7 | 36300154665566155 |
oct | 3546770512427071 |
9 | 562063742865614 |
10 | 130222421323321 |
11 | 38547022a444a8 |
12 | 12731b895050a1 |
13 | 5787bc9ac2482 |
14 | 2422b27d76065 |
15 | 100c5b6122c81 |
hex | 766fc52a2e39 |
130222421323321 has 2 divisors, whose sum is σ = 130222421323322. Its totient is φ = 130222421323320.
The previous prime is 130222421323223. The next prime is 130222421323387. The reversal of 130222421323321 is 123323124222031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66870197856400 + 63352223466921 = 8177420^2 + 7959411^2 .
It is a cyclic number.
It is not a de Polignac number, because 130222421323321 - 27 = 130222421323193 is a prime.
It is not a weakly prime, because it can be changed into another prime (130222421323391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65111210661660 + 65111210661661.
It is an arithmetic number, because the mean of its divisors is an integer number (65111210661661).
Almost surely, 2130222421323321 is an apocalyptic number.
It is an amenable number.
130222421323321 is a deficient number, since it is larger than the sum of its proper divisors (1).
130222421323321 is an equidigital number, since it uses as much as digits as its factorization.
130222421323321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 130222421323321 its reverse (123323124222031), we get a palindrome (253545545545352).
The spelling of 130222421323321 in words is "one hundred thirty trillion, two hundred twenty-two billion, four hundred twenty-one million, three hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •