Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …01111000111111001110011 |
3 | 2121211012020010100221120022 |
4 | 10203010201033013321303 |
5 | 10110204021344411011 |
6 | 110312520531034055 |
7 | 4133053444241153 |
oct | 443044117077163 |
9 | 77735203327508 |
10 | 20002220310131 |
11 | 64119919a9994 |
12 | 22b069313b92b |
13 | b212802a6a07 |
14 | 4d21810a4763 |
15 | 24a484c658db |
hex | 1231213c7e73 |
20002220310131 has 8 divisors (see below), whose sum is σ = 20280077780064. Its totient is φ = 19724467014720.
The previous prime is 20002220310101. The next prime is 20002220310133. The reversal of 20002220310131 is 13101302220002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20002220310131 is a prime.
It is a super-2 number, since 2×200022203101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20002220310133) 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, 25656911 + ... + 26425016.
It is an arithmetic number, because the mean of its divisors is an integer number (2535009722508).
Almost surely, 220002220310131 is an apocalyptic number.
20002220310131 is a deficient number, since it is larger than the sum of its proper divisors (277857469933).
20002220310131 is an equidigital number, since it uses as much as digits as its factorization.
20002220310131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52087261.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20002220310131 its reverse (13101302220002), we get a palindrome (33103522530133).
The spelling of 20002220310131 in words is "twenty trillion, two billion, two hundred twenty million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.363 sec. • engine limits •