Base | Representation |
---|---|
bin | 11101010001010001000… |
… | …001101110100111111101 |
3 | 21010021210012200021010110 |
4 | 131101101001232213331 |
5 | 230423323422232031 |
6 | 4140005402300233 |
7 | 265214316526200 |
oct | 35212101564775 |
9 | 7107705607113 |
10 | 2011404102141 |
11 | 7060391a6595 |
12 | 2859a71b7679 |
13 | 1178a01084c5 |
14 | 6d4d12b1937 |
15 | 374c4290c46 |
hex | 1d45106e9fd |
2011404102141 has 24 divisors (see below), whose sum is σ = 3255369200064. Its totient is φ = 1099400998080.
The previous prime is 2011404102131. The next prime is 2011404102161. The reversal of 2011404102141 is 1412014041102.
It is not a de Polignac number, because 2011404102141 - 215 = 2011404069373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011404102131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 297453600 + ... + 297460361.
It is an arithmetic number, because the mean of its divisors is an integer number (135640383336).
Almost surely, 22011404102141 is an apocalyptic number.
2011404102141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2011404102141 is a deficient number, since it is larger than the sum of its proper divisors (1243965097923).
2011404102141 is a wasteful number, since it uses less digits than its factorization.
2011404102141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 594914001 (or 594913994 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 2011404102141 its reverse (1412014041102), we get a palindrome (3423418143243).
The spelling of 2011404102141 in words is "two trillion, eleven billion, four hundred four million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •