Base | Representation |
---|---|
bin | 101011110011100100101… |
… | …000110110001100111101 |
3 | 101122210010220000222121000 |
4 | 223303210220312030331 |
5 | 343310110113121341 |
6 | 10222530235200513 |
7 | 430326235324323 |
oct | 53634450661475 |
9 | 11583126028530 |
10 | 3010313020221 |
11 | a60737248491 |
12 | 4075038a6139 |
13 | 18ab43326630 |
14 | a59b285bd13 |
15 | 53489d338b6 |
hex | 2bce4a3633d |
3010313020221 has 32 divisors (see below), whose sum is σ = 4968391680000. Its totient is φ = 1788620992704.
The previous prime is 3010313020181. The next prime is 3010313020237. The reversal of 3010313020221 is 1220203130103.
It is not a de Polignac number, because 3010313020221 - 26 = 3010313020157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3010313020194 and 3010313020203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3010313020921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147858621 + ... + 147878978.
It is an arithmetic number, because the mean of its divisors is an integer number (155262240000).
Almost surely, 23010313020221 is an apocalyptic number.
It is an amenable number.
3010313020221 is a deficient number, since it is larger than the sum of its proper divisors (1958078659779).
3010313020221 is a wasteful number, since it uses less digits than its factorization.
3010313020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295737650 (or 295737644 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 3010313020221 its reverse (1220203130103), we get a palindrome (4230516150324).
The spelling of 3010313020221 in words is "three trillion, ten billion, three hundred thirteen million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •