Base | Representation |
---|---|
bin | 101101100011010101000… |
… | …110000010001010101001 |
3 | 102002020212210000020010221 |
4 | 231203111012002022221 |
5 | 402241334144221413 |
6 | 10354013431210041 |
7 | 442105014126436 |
oct | 55432506021251 |
9 | 12066783006127 |
10 | 3130311320233 |
11 | aa7615151359 |
12 | 426812b16921 |
13 | 199258066c96 |
14 | ab717880b8d |
15 | 5665eaa068d |
hex | 2d8d51822a9 |
3130311320233 has 8 divisors (see below), whose sum is σ = 3176723422080. Its totient is φ = 3084068916240.
The previous prime is 3130311320179. The next prime is 3130311320249. The reversal of 3130311320233 is 3320231130313.
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 3130311320233 - 225 = 3130277765801 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3130311320198 and 3130311320207.
It is not an unprimeable number, because it can be changed into a prime (3130311320033) 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, 42387298 + ... + 42461083.
It is an arithmetic number, because the mean of its divisors is an integer number (397090427760).
Almost surely, 23130311320233 is an apocalyptic number.
It is an amenable number.
3130311320233 is a deficient number, since it is larger than the sum of its proper divisors (46412101847).
3130311320233 is an equidigital number, since it uses as much as digits as its factorization.
3130311320233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84848927.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 3130311320233 its reverse (3320231130313), we get a palindrome (6450542450546).
The spelling of 3130311320233 in words is "three trillion, one hundred thirty billion, three hundred eleven million, three hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •