Base | Representation |
---|---|
bin | 101101100011001110100… |
… | …101100000011110000111 |
3 | 102002020121011112210201202 |
4 | 231203032211200132013 |
5 | 402241123221132221 |
6 | 10353554531013115 |
7 | 442102220050454 |
oct | 55431645403607 |
9 | 12066534483652 |
10 | 3130202130311 |
11 | aa7569553353 |
12 | 4267a243a19b |
13 | 19923b556569 |
14 | ab70717a82b |
15 | 566551d2d0b |
hex | 2d8ce960787 |
3130202130311 has 8 divisors (see below), whose sum is σ = 3131907710400. Its totient is φ = 3128496714720.
The previous prime is 3130202130283. The next prime is 3130202130329. The reversal of 3130202130311 is 1130312020313.
3130202130311 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3130202130311 - 26 = 3130202130247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3130202130371) 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, 64865330 + ... + 64913568.
It is an arithmetic number, because the mean of its divisors is an integer number (391488463800).
Almost surely, 23130202130311 is an apocalyptic number.
3130202130311 is a deficient number, since it is larger than the sum of its proper divisors (1705580089).
3130202130311 is a wasteful number, since it uses less digits than its factorization.
3130202130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82249.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3130202130311 its reverse (1130312020313), we get a palindrome (4260514150624).
The spelling of 3130202130311 in words is "three trillion, one hundred thirty billion, two hundred two million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •