Base | Representation |
---|---|
bin | 11101010010110111111… |
… | …110011101110100011001 |
3 | 21010110020120201000100000 |
4 | 131102313332131310121 |
5 | 230440343103100441 |
6 | 4140453022203213 |
7 | 265305161466624 |
oct | 35226776356431 |
9 | 7113216630300 |
10 | 2013131300121 |
11 | 706845155a37 |
12 | 2861a9723509 |
13 | 117ab6bb8546 |
14 | 6d616836dbb |
15 | 37575c182b6 |
hex | 1d4b7f9dd19 |
2013131300121 has 48 divisors (see below), whose sum is σ = 3071620348160. Its totient is φ = 1317230449920.
The previous prime is 2013131300053. The next prime is 2013131300153. The reversal of 2013131300121 is 1210031313102.
2013131300121 is a `hidden beast` number, since 201 + 31 + 313 + 0 + 0 + 121 = 666.
It is not a de Polignac number, because 2013131300121 - 29 = 2013131299609 is a prime.
It is a super-2 number, since 2×20131313001212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013131300094 and 2013131300103.
It is not an unprimeable number, because it can be changed into a prime (2013131310121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6716385 + ... + 7009713.
Almost surely, 22013131300121 is an apocalyptic number.
It is an amenable number.
2013131300121 is a deficient number, since it is larger than the sum of its proper divisors (1058489048039).
2013131300121 is an equidigital number, since it uses as much as digits as its factorization.
2013131300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293868 (or 293856 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2013131300121 its reverse (1210031313102), we get a palindrome (3223162613223).
The spelling of 2013131300121 in words is "two trillion, thirteen billion, one hundred thirty-one million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •