Base | Representation |
---|---|
bin | 11111001001111111111… |
… | …111101001000111000100 |
3 | 21120200101211120020221202 |
4 | 133021333333221013010 |
5 | 240034323010301200 |
6 | 4315325233202032 |
7 | 310453665046661 |
oct | 37117777510704 |
9 | 7520354506852 |
10 | 2141041103300 |
11 | 756012982280 |
12 | 2a6b46400318 |
13 | 126b8ca25308 |
14 | 758ac488a68 |
15 | 3aa602ee1d5 |
hex | 1f27ffe91c4 |
2141041103300 has 36 divisors (see below), whose sum is σ = 5068428214416. Its totient is φ = 778560400800.
The previous prime is 2141041103291. The next prime is 2141041103309. The reversal of 2141041103300 is 33011401412.
It is an interprime number because it is at equal distance from previous prime (2141041103291) and next prime (2141041103309).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (2141041103309) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 973199402 + ... + 973201601.
Almost surely, 22141041103300 is an apocalyptic number.
2141041103300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2141041103300 is an abundant number, since it is smaller than the sum of its proper divisors (2927387111116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141041103300 is a wasteful number, since it uses less digits than its factorization.
2141041103300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1946401028 (or 1946401021 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2141041103300 its reverse (33011401412), we get a palindrome (2174052504712).
The spelling of 2141041103300 in words is "two trillion, one hundred forty-one billion, forty-one million, one hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •