Base | Representation |
---|---|
bin | 11101010100000100010… |
… | …001011100010100100100 |
3 | 21010120112210022221020201 |
4 | 131110010101130110210 |
5 | 231001003300440030 |
6 | 4141224030040244 |
7 | 265351663620520 |
oct | 35240421342444 |
9 | 7116483287221 |
10 | 2014411343140 |
11 | 707341762229 |
12 | 2864a6349084 |
13 | 117c5c156851 |
14 | 6d6d8840d80 |
15 | 375ed2b52ca |
hex | 1d50445c524 |
2014411343140 has 48 divisors (see below), whose sum is σ = 4834674633600. Its totient is φ = 690642830592.
The previous prime is 2014411343137. The next prime is 2014411343167. The reversal of 2014411343140 is 413431144102.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 2014411343099 and 2014411343108.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11077471 + ... + 11257849.
It is an arithmetic number, because the mean of its divisors is an integer number (100722388200).
Almost surely, 22014411343140 is an apocalyptic number.
2014411343140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2014411343140 is an abundant number, since it is smaller than the sum of its proper divisors (2820263290460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2014411343140 is a wasteful number, since it uses less digits than its factorization.
2014411343140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260164 (or 260162 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 2014411343140 its reverse (413431144102), we get a palindrome (2427842487242).
The spelling of 2014411343140 in words is "two trillion, fourteen billion, four hundred eleven million, three hundred forty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •