Base | Representation |
---|---|
bin | 11110101110010011010… |
… | …011100010010100100000 |
3 | 21110211122011000122100202 |
4 | 132232103103202110200 |
5 | 234042420340030100 |
6 | 4253530141004332 |
7 | 305351663365424 |
oct | 36562323422440 |
9 | 7424564018322 |
10 | 2111300314400 |
11 | 744440a933a2 |
12 | 2a12262536a8 |
13 | 124130279384 |
14 | 7428a636b84 |
15 | 39dbe3287d5 |
hex | 1eb934e2520 |
2111300314400 has 72 divisors (see below), whose sum is σ = 5191834146660. Its totient is φ = 838355701760.
The previous prime is 2111300314399. The next prime is 2111300314423. The reversal of 2111300314400 is 44130031112.
It can be written as a sum of positive squares in 6 ways, for example, as 182523763984 + 1928776550416 = 427228^2 + 1388804^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9522245 + ... + 9741444.
Almost surely, 22111300314400 is an apocalyptic number.
2111300314400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2111300314400 is an abundant number, since it is smaller than the sum of its proper divisors (3080533832260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111300314400 is a wasteful number, since it uses less digits than its factorization.
2111300314400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19263846 (or 19263833 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2111300314400 its reverse (44130031112), we get a palindrome (2155430345512).
The spelling of 2111300314400 in words is "two trillion, one hundred eleven billion, three hundred million, three hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •