Base | Representation |
---|---|
bin | 110010000111101111010001… |
… | …101111110101011100000101 |
3 | 1001220111022000012211110221202 |
4 | 302013233101233311130011 |
5 | 212343043042112313110 |
6 | 2100454012251552245 |
7 | 64300561060314422 |
oct | 6207572157653405 |
9 | 1056438005743852 |
10 | 220434125510405 |
11 | 64267651165844 |
12 | 2088173a75b685 |
13 | 95ccb05ba0851 |
14 | 3c610d6354d49 |
15 | 1a73ee67110a5 |
hex | c87bd1bf5705 |
220434125510405 has 64 divisors (see below), whose sum is σ = 280599441408000. Its totient is φ = 165777425280000.
The previous prime is 220434125510317. The next prime is 220434125510407. The reversal of 220434125510405 is 504015521434022.
It is a de Polignac number, because none of the positive numbers 2k-220434125510405 is a prime.
It is a super-4 number, since 4×2204341255104054 (a number of 58 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220434125510407) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 34170532430 + ... + 34170538880.
It is an arithmetic number, because the mean of its divisors is an integer number (4384366272000).
Almost surely, 2220434125510405 is an apocalyptic number.
It is an amenable number.
220434125510405 is a deficient number, since it is larger than the sum of its proper divisors (60165315897595).
220434125510405 is a wasteful number, since it uses less digits than its factorization.
220434125510405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11826.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 220434125510405 its reverse (504015521434022), we get a palindrome (724449646944427).
The spelling of 220434125510405 in words is "two hundred twenty trillion, four hundred thirty-four billion, one hundred twenty-five million, five hundred ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •