Base | Representation |
---|---|
bin | 110010000100101011000010… |
… | …101110011110111011010110 |
3 | 1001212202011010210102121121011 |
4 | 302010223002232132323112 |
5 | 212331120031021202220 |
6 | 2100213124215442434 |
7 | 64246421435012314 |
oct | 6204530256367326 |
9 | 1055664123377534 |
10 | 220223420100310 |
11 | 64196256485590 |
12 | 2084893598641a |
13 | 95b5c969ac4b3 |
14 | 3c54c285690b4 |
15 | 1a6d7b34dd65a |
hex | c84ac2b9eed6 |
220223420100310 has 64 divisors (see below), whose sum is σ = 458047722783744. Its totient is φ = 75342362457600.
The previous prime is 220223420100287. The next prime is 220223420100317. The reversal of 220223420100310 is 13001024322022.
It is a super-2 number, since 2×2202234201003102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220223420100317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17050632 + ... + 27040171.
It is an arithmetic number, because the mean of its divisors is an integer number (7156995668496).
Almost surely, 2220223420100310 is an apocalyptic number.
220223420100310 is an abundant number, since it is smaller than the sum of its proper divisors (237824302683434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220223420100310 is a wasteful number, since it uses less digits than its factorization.
220223420100310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44093509.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 220223420100310 its reverse (13001024322022), we get a palindrome (233224444422332).
The spelling of 220223420100310 in words is "two hundred twenty trillion, two hundred twenty-three billion, four hundred twenty million, one hundred thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •