Base | Representation |
---|---|
bin | 11101010010110110110… |
… | …100111011010100111011 |
3 | 21010110012020102121011210 |
4 | 131102312310323110323 |
5 | 230440323134203311 |
6 | 4140451053054203 |
7 | 265304535566304 |
oct | 35226664732473 |
9 | 7113166377153 |
10 | 2013112022331 |
11 | 706835289283 |
12 | 2861a3187363 |
13 | 117ab2bc8a77 |
14 | 6d6140597ab |
15 | 375741ab3a6 |
hex | 1d4b6d3b53b |
2013112022331 has 8 divisors (see below), whose sum is σ = 2684211325264. Its totient is φ = 1342043700480.
The previous prime is 2013112022303. The next prime is 2013112022371. The reversal of 2013112022331 is 1332202113102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2013112022331 - 221 = 2013109925179 is a prime.
It is a super-2 number, since 2×20131120223312 (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 = 2013112022298 and 2013112022307.
It is not an unprimeable number, because it can be changed into a prime (2013112022371) 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, 7593226 + ... + 7853871.
It is an arithmetic number, because the mean of its divisors is an integer number (335526415658).
Almost surely, 22013112022331 is an apocalyptic number.
2013112022331 is a deficient number, since it is larger than the sum of its proper divisors (671099302933).
2013112022331 is a wasteful number, since it uses less digits than its factorization.
2013112022331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15490541.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2013112022331 its reverse (1332202113102), we get a palindrome (3345314135433).
The spelling of 2013112022331 in words is "two trillion, thirteen billion, one hundred twelve million, twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •