Base | Representation |
---|---|
bin | 1110001111010101001110… |
… | …11001010100101011010011 |
3 | 11002212111122011200100022111 |
4 | 13013222213121110223103 |
5 | 13101013232211134303 |
6 | 150333014310250151 |
7 | 6411204206405356 |
oct | 707524731245323 |
9 | 132774564610274 |
10 | 31313120021203 |
11 | 9a82901a14379 |
12 | 3618838656957 |
13 | 1461a7873bb37 |
14 | 7a37c51c429d |
15 | 3947d595cb6d |
hex | 1c7aa7654ad3 |
31313120021203 has 8 divisors (see below), whose sum is σ = 32201646951600. Its totient is φ = 30436519627008.
The previous prime is 31313120021143. The next prime is 31313120021213. The reversal of 31313120021203 is 30212002131313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31313120021203 is a prime.
It is a super-2 number, since 2×313131200212032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31313120021213) 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, 2981628726 + ... + 2981639227.
It is an arithmetic number, because the mean of its divisors is an integer number (4025205868950).
Almost surely, 231313120021203 is an apocalyptic number.
31313120021203 is a deficient number, since it is larger than the sum of its proper divisors (888526930397).
31313120021203 is an equidigital number, since it uses as much as digits as its factorization.
31313120021203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5963268101.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31313120021203 its reverse (30212002131313), we get a palindrome (61525122152516).
The spelling of 31313120021203 in words is "thirty-one trillion, three hundred thirteen billion, one hundred twenty million, twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •