Base | Representation |
---|---|
bin | 11101010011001000000… |
… | …100011100000011111000 |
3 | 21010110221101202111020110 |
4 | 131103020010130003320 |
5 | 230441421213114430 |
6 | 4140535505224320 |
7 | 265314650454120 |
oct | 35231004340370 |
9 | 7113841674213 |
10 | 2013401301240 |
11 | 7069735aa85a |
12 | 2862640320a0 |
13 | 117b2ab11a14 |
14 | 6d64063bc80 |
15 | 3758e79d7b0 |
hex | 1d4c811c0f8 |
2013401301240 has 64 divisors (see below), whose sum is σ = 6903090178560. Its totient is φ = 460206011520.
The previous prime is 2013401301217. The next prime is 2013401301257. The reversal of 2013401301240 is 421031043102.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1198452316 + ... + 1198453995.
It is an arithmetic number, because the mean of its divisors is an integer number (107860784040).
Almost surely, 22013401301240 is an apocalyptic number.
2013401301240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013401301240 is an abundant number, since it is smaller than the sum of its proper divisors (4889688877320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013401301240 is a wasteful number, since it uses less digits than its factorization.
2013401301240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2396906332 (or 2396906328 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2013401301240 its reverse (421031043102), we get a palindrome (2434432344342).
The spelling of 2013401301240 in words is "two trillion, thirteen billion, four hundred one million, three hundred one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •