Base | Representation |
---|---|
bin | 10010111010101001… |
… | …100010110110011101 |
3 | 1221102112100001202200 |
4 | 102322221202312131 |
5 | 313044144301023 |
6 | 13155250042113 |
7 | 1316222250153 |
oct | 227251426635 |
9 | 57375301680 |
10 | 20311322013 |
11 | 8683236944 |
12 | 3b2a279339 |
13 | 1bb903ac48 |
14 | da97a53d3 |
15 | 7dd264743 |
hex | 4baa62d9d |
20311322013 has 12 divisors (see below), whose sum is σ = 30131511228. Its totient is φ = 13174911360.
The previous prime is 20311321997. The next prime is 20311322027. The reversal of 20311322013 is 31022311302.
20311322013 is a `hidden beast` number, since 20 + 311 + 322 + 0 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 13539184164 + 6772137849 = 116358^2 + 82293^2 .
It is not a de Polignac number, because 20311322013 - 24 = 20311321997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20311322513) 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 11 ways as a sum of consecutive naturals, for example, 30497148 + ... + 30497813.
It is an arithmetic number, because the mean of its divisors is an integer number (2510959269).
Almost surely, 220311322013 is an apocalyptic number.
It is an amenable number.
20311322013 is a deficient number, since it is larger than the sum of its proper divisors (9820189215).
20311322013 is a wasteful number, since it uses less digits than its factorization.
20311322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60995004 (or 60995001 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 20311322013 its reverse (31022311302), we get a palindrome (51333633315).
The spelling of 20311322013 in words is "twenty billion, three hundred eleven million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •