Base | Representation |
---|---|
bin | 110011000011101110010000… |
… | …110101011010000000111011 |
3 | 1002110002100211000201122201202 |
4 | 303003232100311122000323 |
5 | 213413112101443243214 |
6 | 2113331410234204415 |
7 | 65204436045326342 |
oct | 6303562065320073 |
9 | 1073070730648652 |
10 | 224556205056059 |
11 | 6560682a6499a8 |
12 | 212285b688370b |
13 | 983b73695c316 |
14 | 3d64814c80b59 |
15 | 1ae634eee86de |
hex | cc3b90d5a03b |
224556205056059 has 2 divisors, whose sum is σ = 224556205056060. Its totient is φ = 224556205056058.
The previous prime is 224556205055957. The next prime is 224556205056163. The reversal of 224556205056059 is 950650502655422.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-224556205056059 is a prime.
It is a super-2 number, since 2×2245562050560592 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 224556205055995 and 224556205056013.
It is not a weakly prime, because it can be changed into another prime (224556205059059) 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, 112278102528029 + 112278102528030.
It is an arithmetic number, because the mean of its divisors is an integer number (112278102528030).
Almost surely, 2224556205056059 is an apocalyptic number.
224556205056059 is a deficient number, since it is larger than the sum of its proper divisors (1).
224556205056059 is an equidigital number, since it uses as much as digits as its factorization.
224556205056059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400000, while the sum is 56.
The spelling of 224556205056059 in words is "two hundred twenty-four trillion, five hundred fifty-six billion, two hundred five million, fifty-six thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •