Base | Representation |
---|---|
bin | 1101000001000011010… |
… | …0101111011011011001 |
3 | 210101012111112111012020 |
4 | 3100100310233123121 |
5 | 12130433330414401 |
6 | 250421352405053 |
7 | 22104345255114 |
oct | 3202064573331 |
9 | 711174474166 |
10 | 223620560601 |
11 | 86922a81a69 |
12 | 3740a0a6789 |
13 | 18119b25559 |
14 | ab7518957b |
15 | 5c3beb3d36 |
hex | 3410d2f6d9 |
223620560601 has 8 divisors (see below), whose sum is σ = 307778836224. Its totient is φ = 144271329360.
The previous prime is 223620560593. The next prime is 223620560671. The reversal of 223620560601 is 106065026322.
223620560601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 223620560601 - 23 = 223620560593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (223620560671) 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 in 7 ways as a sum of consecutive naturals, for example, 1202260986 + ... + 1202261171.
It is an arithmetic number, because the mean of its divisors is an integer number (38472354528).
Almost surely, 2223620560601 is an apocalyptic number.
It is an amenable number.
223620560601 is a deficient number, since it is larger than the sum of its proper divisors (84158275623).
223620560601 is a wasteful number, since it uses less digits than its factorization.
223620560601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2404522191.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 223620560601 its reverse (106065026322), we get a palindrome (329685586923).
The spelling of 223620560601 in words is "two hundred twenty-three billion, six hundred twenty million, five hundred sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •