Base | Representation |
---|---|
bin | 1010000100000110101000… |
… | …01011100111000010100001 |
3 | 2220100201120120012020212021 |
4 | 11002003110023213002201 |
5 | 10400044230204303043 |
6 | 115022540341501441 |
7 | 4442633354246113 |
oct | 502032413470241 |
9 | 86321516166767 |
10 | 22131231322273 |
11 | 7062891137667 |
12 | 2595220711881 |
13 | c46c7385cb98 |
14 | 56722b93b3b3 |
15 | 285a3dd4d3ed |
hex | 1420d42e70a1 |
22131231322273 has 2 divisors, whose sum is σ = 22131231322274. Its totient is φ = 22131231322272.
The previous prime is 22131231322247. The next prime is 22131231322349. The reversal of 22131231322273 is 37222313213122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14814893376144 + 7316337946129 = 3849012^2 + 2704873^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22131231322273 is a prime.
It is not a weakly prime, because it can be changed into another prime (22131231322373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11065615661136 + 11065615661137.
It is an arithmetic number, because the mean of its divisors is an integer number (11065615661137).
Almost surely, 222131231322273 is an apocalyptic number.
It is an amenable number.
22131231322273 is a deficient number, since it is larger than the sum of its proper divisors (1).
22131231322273 is an equidigital number, since it uses as much as digits as its factorization.
22131231322273 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36288, while the sum is 34.
Adding to 22131231322273 its reverse (37222313213122), we get a palindrome (59353544535395).
The spelling of 22131231322273 in words is "twenty-two trillion, one hundred thirty-one billion, two hundred thirty-one million, three hundred twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •