Base | Representation |
---|---|
bin | 11101010011001110000… |
… | …000101011101001001001 |
3 | 21010111012100022200111102 |
4 | 131103032000223221021 |
5 | 230442122222323120 |
6 | 4140553425511145 |
7 | 265320300640121 |
oct | 35231600535111 |
9 | 7114170280442 |
10 | 2013500979785 |
11 | 706a148a1819 |
12 | 2862914a24b5 |
13 | 117b456720c9 |
14 | 6d64d987c81 |
15 | 375983dcd75 |
hex | 1d4ce02ba49 |
2013500979785 has 32 divisors (see below), whose sum is σ = 2575210488480. Its totient is φ = 1506049339392.
The previous prime is 2013500979781. The next prime is 2013500979863. The reversal of 2013500979785 is 5879790053102.
It can be written as a sum of positive squares in 16 ways, for example, as 22613843641 + 1990887136144 = 150379^2 + 1410988^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013500979785 - 22 = 2013500979781 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2013500979785.
It is not an unprimeable number, because it can be changed into a prime (2013500979781) 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 31 ways as a sum of consecutive naturals, for example, 69232667 + ... + 69261743.
It is an arithmetic number, because the mean of its divisors is an integer number (80475327765).
Almost surely, 22013500979785 is an apocalyptic number.
It is an amenable number.
2013500979785 is a deficient number, since it is larger than the sum of its proper divisors (561709508695).
2013500979785 is a wasteful number, since it uses less digits than its factorization.
2013500979785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34445.
The product of its (nonzero) digits is 4762800, while the sum is 56.
The spelling of 2013500979785 in words is "two trillion, thirteen billion, five hundred million, nine hundred seventy-nine thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •