Base | Representation |
---|---|
bin | 1100110101010000100… |
… | …1001010011101001001 |
3 | 210002000220000101100010 |
4 | 3031110021022131021 |
5 | 12102442441122421 |
6 | 245135312102133 |
7 | 21633036516612 |
oct | 3152411123511 |
9 | 702026011303 |
10 | 220455020361 |
11 | 85549125804 |
12 | 36885b34949 |
13 | 17a34060914 |
14 | a9549b0c09 |
15 | 5b04121076 |
hex | 335424a749 |
220455020361 has 8 divisors (see below), whose sum is σ = 294126189280. Its totient is φ = 146876932512.
The previous prime is 220455020297. The next prime is 220455020369. The reversal of 220455020361 is 163020554022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220455020361 - 26 = 220455020297 is a prime.
It is a super-5 number, since 5×2204550203615 (a number of 58 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220455020369) 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 in 7 ways as a sum of consecutive naturals, for example, 23264740 + ... + 23274213.
It is an arithmetic number, because the mean of its divisors is an integer number (36765773660).
Almost surely, 2220455020361 is an apocalyptic number.
It is an amenable number.
220455020361 is a deficient number, since it is larger than the sum of its proper divisors (73671168919).
220455020361 is a wasteful number, since it uses less digits than its factorization.
220455020361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46540535.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 220455020361 its reverse (163020554022), we get a palindrome (383475574383).
The spelling of 220455020361 in words is "two hundred twenty billion, four hundred fifty-five million, twenty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •