Base | Representation |
---|---|
bin | 1010001110111101001010… |
… | …01000001010100001100001 |
3 | 2221200101000201000010201201 |
4 | 11013132211020022201201 |
5 | 10422201401113412031 |
6 | 115510124230201201 |
7 | 4511603451142132 |
oct | 507364510124141 |
9 | 87611021003651 |
10 | 22504104044641 |
11 | 7196a3406384a |
12 | 2635542ab3201 |
13 | c7318801604b |
14 | 57b2c1009c89 |
15 | 2905b3e1ed61 |
hex | 1477a520a861 |
22504104044641 has 2 divisors, whose sum is σ = 22504104044642. Its totient is φ = 22504104044640.
The previous prime is 22504104044629. The next prime is 22504104044671. The reversal of 22504104044641 is 14644040140522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15936032064016 + 6568071980625 = 3991996^2 + 2562825^2 .
It is a cyclic number.
It is not a de Polignac number, because 22504104044641 - 227 = 22503969826913 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22504104044641.
It is not a weakly prime, because it can be changed into another prime (22504104044671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11252052022320 + 11252052022321.
It is an arithmetic number, because the mean of its divisors is an integer number (11252052022321).
Almost surely, 222504104044641 is an apocalyptic number.
It is an amenable number.
22504104044641 is a deficient number, since it is larger than the sum of its proper divisors (1).
22504104044641 is an equidigital number, since it uses as much as digits as its factorization.
22504104044641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122880, while the sum is 37.
The spelling of 22504104044641 in words is "twenty-two trillion, five hundred four billion, one hundred four million, forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •