Base | Representation |
---|---|
bin | 101101010000100110011… |
… | …111000100111100001101 |
3 | 102000022222022210002010200 |
4 | 231100212133010330031 |
5 | 401424143203100323 |
6 | 10340450154524113 |
7 | 440463463554144 |
oct | 55204637047415 |
9 | 12008868702120 |
10 | 3110202003213 |
11 | a9a035a47898 |
12 | 422940436639 |
13 | 1973a1b35b26 |
14 | aa76ac6075b |
15 | 55d8443e443 |
hex | 2d4267c4f0d |
3110202003213 has 12 divisors (see below), whose sum is σ = 4492723248000. Its totient is φ = 2073371428296.
The previous prime is 3110202003203. The next prime is 3110202003257. The reversal of 3110202003213 is 3123002020113.
3110202003213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3110202003213 - 216 = 3110201937677 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3110202003203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7843581 + ... + 8230562.
It is an arithmetic number, because the mean of its divisors is an integer number (374393604000).
Almost surely, 23110202003213 is an apocalyptic number.
It is an amenable number.
3110202003213 is a deficient number, since it is larger than the sum of its proper divisors (1382521244787).
3110202003213 is a wasteful number, since it uses less digits than its factorization.
3110202003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16095648 (or 16095645 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 3110202003213 its reverse (3123002020113), we get a palindrome (6233204023326).
The spelling of 3110202003213 in words is "three trillion, one hundred ten billion, two hundred two million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •