Base | Representation |
---|---|
bin | 11111001010001111011… |
… | …111100100101011110100 |
3 | 21120201001221212002022002 |
4 | 133022033133210223310 |
5 | 240040341042211040 |
6 | 4315411122354432 |
7 | 310463303211131 |
oct | 37121737445364 |
9 | 7521057762262 |
10 | 2141301132020 |
11 | 756136735746 |
12 | 2a6bb94bba18 |
13 | 126c0186966b |
14 | 758d4c15588 |
15 | 3aa78064a15 |
hex | 1f28f7e4af4 |
2141301132020 has 48 divisors (see below), whose sum is σ = 4775291115840. Its totient is φ = 804259524096.
The previous prime is 2141301132017. The next prime is 2141301132071. The reversal of 2141301132020 is 202311031412.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 2141301131983 and 2141301132001.
It is a congruent number.
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, 24890702 + ... + 24976581.
It is an arithmetic number, because the mean of its divisors is an integer number (99485231580).
Almost surely, 22141301132020 is an apocalyptic number.
2141301132020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2141301132020 is an abundant number, since it is smaller than the sum of its proper divisors (2633989983820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141301132020 is a wasteful number, since it uses less digits than its factorization.
2141301132020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49867424 (or 49867422 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2141301132020 its reverse (202311031412), we get a palindrome (2343612163432).
The spelling of 2141301132020 in words is "two trillion, one hundred forty-one billion, three hundred one million, one hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •