Base | Representation |
---|---|
bin | 101101000111010011100… |
… | …001001011010110000101 |
3 | 101222101012200002101010221 |
4 | 231013103201023112011 |
5 | 401243222322011323 |
6 | 10332115500144341 |
7 | 436661226065242 |
oct | 55072341132605 |
9 | 11871180071127 |
10 | 3100220110213 |
11 | a9588347a946 |
12 | 420a155380b1 |
13 | 196470b18275 |
14 | aa0a12925c9 |
15 | 5599ce5b55d |
hex | 2d1d384b585 |
3100220110213 has 8 divisors (see below), whose sum is σ = 3130927345728. Its totient is φ = 3069524567424.
The previous prime is 3100220110193. The next prime is 3100220110303. The reversal of 3100220110213 is 3120110220013.
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-3100220110213 is a prime.
It is a super-2 number, since 2×31002201102132 (a number of 26 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 (3100220110313) 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, 2389795 + ... + 3451312.
It is an arithmetic number, because the mean of its divisors is an integer number (391365918216).
Almost surely, 23100220110213 is an apocalyptic number.
It is an amenable number.
3100220110213 is a deficient number, since it is larger than the sum of its proper divisors (30707235515).
3100220110213 is a wasteful number, since it uses less digits than its factorization.
3100220110213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5846363.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3100220110213 its reverse (3120110220013), we get a palindrome (6220330330226).
The spelling of 3100220110213 in words is "three trillion, one hundred billion, two hundred twenty million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •