Base | Representation |
---|---|
bin | 1110001111100010011011… |
… | …00001010100000100010101 |
3 | 11002220011220201212021102201 |
4 | 13013301031201110010111 |
5 | 13101122233214213023 |
6 | 150340145140004501 |
7 | 6411544543162360 |
oct | 707611541240425 |
9 | 132804821767381 |
10 | 31320202101013 |
11 | 9a8590662a7a1 |
12 | 361a094390731 |
13 | 1462636a529c7 |
14 | 7a3c979c90d7 |
15 | 394a9c58bbad |
hex | 1c7c4d854115 |
31320202101013 has 16 divisors (see below), whose sum is σ = 37781104721920. Its totient is φ = 25363646446896.
The previous prime is 31320202100963. The next prime is 31320202101031. The reversal of 31320202101013 is 31010120202313.
It is a cyclic number.
It is not a de Polignac number, because 31320202101013 - 229 = 31319665230101 is a prime.
It is a super-3 number, since 3×313202021010133 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31320202101043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320782581 + ... + 320880202.
It is an arithmetic number, because the mean of its divisors is an integer number (2361319045120).
Almost surely, 231320202101013 is an apocalyptic number.
It is an amenable number.
31320202101013 is a deficient number, since it is larger than the sum of its proper divisors (6460902620907).
31320202101013 is a wasteful number, since it uses less digits than its factorization.
31320202101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641663176.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 31320202101013 its reverse (31010120202313), we get a palindrome (62330322303326).
The spelling of 31320202101013 in words is "thirty-one trillion, three hundred twenty billion, two hundred two million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •