Base | Representation |
---|---|
bin | 1110000111011100101001… |
… | …00101001011010110111101 |
3 | 11001220121101210011122121000 |
4 | 13003232110211023112331 |
5 | 13032043432141001023 |
6 | 150004333305200513 |
7 | 6352504120326114 |
oct | 703562445132675 |
9 | 131817353148530 |
10 | 31042221422013 |
11 | 9988a287a624a |
12 | 3594235190139 |
13 | 1442365a7c429 |
14 | 794647016c7b |
15 | 38c72d076243 |
hex | 1c3b9494b5bd |
31042221422013 has 32 divisors (see below), whose sum is σ = 46144023045120. Its totient is φ = 20624834997360.
The previous prime is 31042221421997. The next prime is 31042221422027. The reversal of 31042221422013 is 31022412224013.
31042221422013 is a `hidden beast` number, since 3 + 1 + 0 + 4 + 2 + 221 + 422 + 0 + 13 = 666.
It is not a de Polignac number, because 31042221422013 - 24 = 31042221421997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31042221422713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67500256 + ... + 67958582.
It is an arithmetic number, because the mean of its divisors is an integer number (1442000720160).
Almost surely, 231042221422013 is an apocalyptic number.
It is an amenable number.
31042221422013 is a deficient number, since it is larger than the sum of its proper divisors (15101801623107).
31042221422013 is a wasteful number, since it uses less digits than its factorization.
31042221422013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466814 (or 466808 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 31042221422013 its reverse (31022412224013), we get a palindrome (62064633646026).
The spelling of 31042221422013 in words is "thirty-one trillion, forty-two billion, two hundred twenty-one million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •