Base | Representation |
---|---|
bin | 101101100011010101001… |
… | …101010010010011000001 |
3 | 102002020212220120210221022 |
4 | 231203111031102103001 |
5 | 402241340141040223 |
6 | 10354013540035225 |
7 | 442105036235105 |
oct | 55432515222301 |
9 | 12066786523838 |
10 | 3130313221313 |
11 | aa761622a6a3 |
12 | 426813692b15 |
13 | 199258581395 |
14 | ab717c17905 |
15 | 5665ed28ac8 |
hex | 2d8d53524c1 |
3130313221313 has 16 divisors (see below), whose sum is σ = 3220605463680. Its totient is φ = 3040828094976.
The previous prime is 3130313221309. The next prime is 3130313221337. The reversal of 3130313221313 is 3131223130313.
It is a cyclic number.
It is not a de Polignac number, because 3130313221313 - 22 = 3130313221309 is a prime.
It is a super-3 number, since 3×31303132213133 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3130313221393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22437908 + ... + 22576986.
It is an arithmetic number, because the mean of its divisors is an integer number (201287841480).
Almost surely, 23130313221313 is an apocalyptic number.
It is an amenable number.
3130313221313 is a deficient number, since it is larger than the sum of its proper divisors (90292242367).
3130313221313 is a wasteful number, since it uses less digits than its factorization.
3130313221313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141976.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 3130313221313 its reverse (3131223130313), we get a palindrome (6261536351626).
The spelling of 3130313221313 in words is "three trillion, one hundred thirty billion, three hundred thirteen million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •