Base | Representation |
---|---|
bin | 11101010011111000000… |
… | …000101111000010000100 |
3 | 21010120000110020222010011 |
4 | 131103320000233002010 |
5 | 231000043120333430 |
6 | 4141151401040004 |
7 | 265343615265433 |
oct | 35237000570204 |
9 | 7116013228104 |
10 | 2014205636740 |
11 | 707246631a40 |
12 | 286449486004 |
13 | 117c2865209b |
14 | 6d6b93b511a |
15 | 375da1d022a |
hex | 1d4f802f084 |
2014205636740 has 48 divisors (see below), whose sum is σ = 4614823471104. Its totient is φ = 732365164800.
The previous prime is 2014205636719. The next prime is 2014205636741. The reversal of 2014205636740 is 476365024102.
It is a junction number, because it is equal to n+sod(n) for n = 2014205636693 and 2014205636702.
It is not an unprimeable number, because it can be changed into a prime (2014205636741) by changing a digit.
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, 1771672 + ... + 2677168.
It is an arithmetic number, because the mean of its divisors is an integer number (96142155648).
Almost surely, 22014205636740 is an apocalyptic number.
2014205636740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2014205636740 is an abundant number, since it is smaller than the sum of its proper divisors (2600617834364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2014205636740 is a wasteful number, since it uses less digits than its factorization.
2014205636740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915628 (or 915626 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 40.
The spelling of 2014205636740 in words is "two trillion, fourteen billion, two hundred five million, six hundred thirty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •