Base | Representation |
---|---|
bin | 1100110100000011000… |
… | …1011011011000001001 |
3 | 210001012020111012220022 |
4 | 3031000301123120021 |
5 | 12101311241443423 |
6 | 245043142310225 |
7 | 21622012251236 |
oct | 3150061333011 |
9 | 701166435808 |
10 | 220130031113 |
11 | 853a1733553 |
12 | 367b5128375 |
13 | 179b19237a5 |
14 | a92377478d |
15 | 5ad5827dc8 |
hex | 3340c5b609 |
220130031113 has 8 divisors (see below), whose sum is σ = 221556928320. Its totient is φ = 218703448080.
The previous prime is 220130031059. The next prime is 220130031221. The reversal of 220130031113 is 311130031022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220130031113 - 214 = 220130014729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220130031091 and 220130031100.
It is not an unprimeable number, because it can be changed into a prime (220130039113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1419518 + ... + 1566936.
It is an arithmetic number, because the mean of its divisors is an integer number (27694616040).
Almost surely, 2220130031113 is an apocalyptic number.
It is an amenable number.
220130031113 is a deficient number, since it is larger than the sum of its proper divisors (1426897207).
220130031113 is a wasteful number, since it uses less digits than its factorization.
220130031113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157087.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 220130031113 its reverse (311130031022), we get a palindrome (531260062135).
Subtracting 220130031113 from its reverse (311130031022), we obtain a palindrome (90999999909).
The spelling of 220130031113 in words is "two hundred twenty billion, one hundred thirty million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •