Base | Representation |
---|---|
bin | 11101010010110000110… |
… | …100011001011000111111 |
3 | 21010102221012202022102021 |
4 | 131102300310121120333 |
5 | 230440121333020111 |
6 | 4140433052341011 |
7 | 265302203023120 |
oct | 35226064313077 |
9 | 7112835668367 |
10 | 2013011220031 |
11 | 706793399a99 |
12 | 286175474767 |
13 | 117a98064036 |
14 | 6d6048da047 |
15 | 3756a3e8d71 |
hex | 1d4b0d1963f |
2013011220031 has 8 divisors (see below), whose sum is σ = 2421667633280. Its totient is φ = 1634625652248.
The previous prime is 2013011219959. The next prime is 2013011220043. The reversal of 2013011220031 is 1300221103102.
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 2013011220031 - 211 = 2013011217983 is a prime.
It is a super-2 number, since 2×20130112200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2013011219987 and 2013011220014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013011221031) 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, 7567711221 + ... + 7567711486.
It is an arithmetic number, because the mean of its divisors is an integer number (302708454160).
Almost surely, 22013011220031 is an apocalyptic number.
2013011220031 is a deficient number, since it is larger than the sum of its proper divisors (408656413249).
2013011220031 is a wasteful number, since it uses less digits than its factorization.
2013011220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15135422733.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2013011220031 its reverse (1300221103102), we get a palindrome (3313232323133).
The spelling of 2013011220031 in words is "two trillion, thirteen billion, eleven million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •