Base | Representation |
---|---|
bin | 101101100011001110101… |
… | …001010010011010110101 |
3 | 102002020121020102011011021 |
4 | 231203032221102122311 |
5 | 402241123444340313 |
6 | 10353555004141141 |
7 | 442102231345651 |
oct | 55431651223265 |
9 | 12066536364137 |
10 | 3130203121333 |
11 | aa756a06a982 |
12 | 4267a28377b1 |
13 | 19923b812672 |
14 | ab707357a61 |
15 | 5665532b78d |
hex | 2d8cea526b5 |
3130203121333 has 2 divisors, whose sum is σ = 3130203121334. Its totient is φ = 3130203121332.
The previous prime is 3130203121327. The next prime is 3130203121351. The reversal of 3130203121333 is 3331213020313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2951444972529 + 178758148804 = 1717977^2 + 422798^2 .
It is a cyclic number.
It is not a de Polignac number, because 3130203121333 - 217 = 3130202990261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3130203121298 and 3130203121307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3130203121393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1565101560666 + 1565101560667.
It is an arithmetic number, because the mean of its divisors is an integer number (1565101560667).
Almost surely, 23130203121333 is an apocalyptic number.
It is an amenable number.
3130203121333 is a deficient number, since it is larger than the sum of its proper divisors (1).
3130203121333 is an equidigital number, since it uses as much as digits as its factorization.
3130203121333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 3130203121333 its reverse (3331213020313), we get a palindrome (6461416141646).
The spelling of 3130203121333 in words is "three trillion, one hundred thirty billion, two hundred three million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •