Base | Representation |
---|---|
bin | 11110100101111100110… |
… | …100110000111011000000 |
3 | 21102222111012211202122221 |
4 | 132211330310300323000 |
5 | 233421034300330100 |
6 | 4245444252540424 |
7 | 304613530321636 |
oct | 36457464607300 |
9 | 7388435752587 |
10 | 2102333214400 |
11 | 74065a323451 |
12 | 29b543181714 |
13 | 123331578043 |
14 | 73a79747356 |
15 | 39a46e9a01a |
hex | 1e97cd30ec0 |
2102333214400 has 42 divisors (see below), whose sum is σ = 5173053669620. Its totient is φ = 840933285120.
The previous prime is 2102333214391. The next prime is 2102333214409. The reversal of 2102333214400 is 44123332012.
It is an interprime number because it is at equal distance from previous prime (2102333214391) and next prime (2102333214409).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (2102333214409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 656977530 + ... + 656980729.
Almost surely, 22102333214400 is an apocalyptic number.
2102333214400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2102333214400 is an abundant number, since it is smaller than the sum of its proper divisors (3070720455220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102333214400 is a wasteful number, since it uses less digits than its factorization.
2102333214400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313958281 (or 1313958266 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 2102333214400 its reverse (44123332012), we get a palindrome (2146456546412).
The spelling of 2102333214400 in words is "two trillion, one hundred two billion, three hundred thirty-three million, two hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •