Base | Representation |
---|---|
bin | 1010001101000111110110… |
… | …01000011011010010111001 |
3 | 2221110100110102000100110122 |
4 | 11012203323020123102321 |
5 | 10420133404321210343 |
6 | 115421150452023025 |
7 | 4504213635314435 |
oct | 506437310332271 |
9 | 87410412010418 |
10 | 22441122444473 |
11 | 7172254643417 |
12 | 26252a6601a75 |
13 | c6a25b947605 |
14 | 57822857d9c5 |
15 | 28db29a60068 |
hex | 1468fb21b4b9 |
22441122444473 has 2 divisors, whose sum is σ = 22441122444474. Its totient is φ = 22441122444472.
The previous prime is 22441122444409. The next prime is 22441122444487. The reversal of 22441122444473 is 37444422114422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21362957952064 + 1078164492409 = 4622008^2 + 1038347^2 .
It is a cyclic number.
It is not a de Polignac number, because 22441122444473 - 26 = 22441122444409 is a prime.
It is not a weakly prime, because it can be changed into another prime (22441122444493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11220561222236 + 11220561222237.
It is an arithmetic number, because the mean of its divisors is an integer number (11220561222237).
Almost surely, 222441122444473 is an apocalyptic number.
It is an amenable number.
22441122444473 is a deficient number, since it is larger than the sum of its proper divisors (1).
22441122444473 is an equidigital number, since it uses as much as digits as its factorization.
22441122444473 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1376256, while the sum is 44.
Adding to 22441122444473 its reverse (37444422114422), we get a palindrome (59885544558895).
The spelling of 22441122444473 in words is "twenty-two trillion, four hundred forty-one billion, one hundred twenty-two million, four hundred forty-four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •