Base | Representation |
---|---|
bin | 1110000110110011010010… |
… | …10110011100000001000001 |
3 | 11001211111002121201200010102 |
4 | 13003121221112130001001 |
5 | 13031213000423120223 |
6 | 145550222343412145 |
7 | 6351060021401132 |
oct | 703315126340101 |
9 | 131744077650112 |
10 | 31020021301313 |
11 | 997a576374a60 |
12 | 358ba7a454055 |
13 | 1440238630235 |
14 | 79353c861c89 |
15 | 38bd7e0b7928 |
hex | 1c366959c041 |
31020021301313 has 8 divisors (see below), whose sum is σ = 33840068566080. Its totient is φ = 28199981591280.
The previous prime is 31020021301301. The next prime is 31020021301333. The reversal of 31020021301313 is 31310312002013.
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 31020021301313 - 226 = 31019954192449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31020021301333) 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 7 ways as a sum of consecutive naturals, for example, 9891083 + ... + 12644111.
It is an arithmetic number, because the mean of its divisors is an integer number (4230008570760).
Almost surely, 231020021301313 is an apocalyptic number.
It is an amenable number.
31020021301313 is a deficient number, since it is larger than the sum of its proper divisors (2820047264767).
31020021301313 is a wasteful number, since it uses less digits than its factorization.
31020021301313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777367.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31020021301313 its reverse (31310312002013), we get a palindrome (62330333303326).
The spelling of 31020021301313 in words is "thirty-one trillion, twenty billion, twenty-one million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •