Base | Representation |
---|---|
bin | 101011110011100100100… |
… | …101101110001110011001 |
3 | 101122210010211111100222200 |
4 | 223303210211232032121 |
5 | 343310104410413423 |
6 | 10222530205440413 |
7 | 430326225343260 |
oct | 53634445561631 |
9 | 11583124440880 |
10 | 3010312201113 |
11 | a60736839038 |
12 | 407503570109 |
13 | 18ab430ca859 |
14 | a59b26c75d7 |
15 | 53489c20d43 |
hex | 2bce496e399 |
3010312201113 has 96 divisors (see below), whose sum is σ = 5109023462400. Its totient is φ = 1672240526208.
The previous prime is 3010312201069. The next prime is 3010312201159. The reversal of 3010312201113 is 3111022130103.
3010312201113 is a `hidden beast` number, since 30 + 10 + 312 + 201 + 113 = 666.
It is not a de Polignac number, because 3010312201113 - 210 = 3010312200089 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3010312202113) 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 95 ways as a sum of consecutive naturals, for example, 1185627798 + ... + 1185630336.
It is an arithmetic number, because the mean of its divisors is an integer number (53218994400).
Almost surely, 23010312201113 is an apocalyptic number.
It is an amenable number.
3010312201113 is a deficient number, since it is larger than the sum of its proper divisors (2098711261287).
3010312201113 is a wasteful number, since it uses less digits than its factorization.
3010312201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4491 (or 4488 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 3010312201113 its reverse (3111022130103), we get a palindrome (6121334331216).
The spelling of 3010312201113 in words is "three trillion, ten billion, three hundred twelve million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •