Base | Representation |
---|---|
bin | 110010000011010000101001… |
… | …001001110111000110000101 |
3 | 1001212101212121010000100001112 |
4 | 302003100221021313012011 |
5 | 212323022233200233123 |
6 | 2100100352350534405 |
7 | 64236414160245533 |
oct | 6203205111670605 |
9 | 1055355533010045 |
10 | 220126354305413 |
11 | 64159076361186 |
12 | 20831b66807405 |
13 | 95a9a980587ba |
14 | 3c5025b0a5153 |
15 | 1a6aed1b9cd78 |
hex | c83429277185 |
220126354305413 has 8 divisors (see below), whose sum is σ = 233077120895232. Its totient is φ = 207175827439296.
The previous prime is 220126354305397. The next prime is 220126354305449. The reversal of 220126354305413 is 314503453621022.
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 220126354305413 - 24 = 220126354305397 is a prime.
It is a super-2 number, since 2×2201263543054132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220126354005413) 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, 58038695 + ... + 61715012.
It is an arithmetic number, because the mean of its divisors is an integer number (29134640111904).
Almost surely, 2220126354305413 is an apocalyptic number.
It is an amenable number.
220126354305413 is a deficient number, since it is larger than the sum of its proper divisors (12950766589819).
220126354305413 is a wasteful number, since it uses less digits than its factorization.
220126354305413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119861851.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 220126354305413 in words is "two hundred twenty trillion, one hundred twenty-six billion, three hundred fifty-four million, three hundred five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •