Base | Representation |
---|---|
bin | 10000100101101110101… |
… | …000010101010011001000 |
3 | 11000222121010021100112021 |
4 | 100211232220111103020 |
5 | 122134231213301300 |
6 | 2231415152254224 |
7 | 145235550342025 |
oct | 20455650252310 |
9 | 4028533240467 |
10 | 1140022400200 |
11 | 3aa531a196a2 |
12 | 164b3b241374 |
13 | 836716a1598 |
14 | 3d26aa2654c |
15 | 1e9c440ed1a |
hex | 1096ea154c8 |
1140022400200 has 24 divisors (see below), whose sum is σ = 2650552080930. Its totient is φ = 456008960000.
The previous prime is 1140022400141. The next prime is 1140022400207. The reversal of 1140022400200 is 20042200411.
It can be written as a sum of positive squares in 3 ways, for example, as 1021987552356 + 118034847844 = 1010934^2 + 343562^2 .
It is not an unprimeable number, because it can be changed into a prime (1140022400207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2850055801 + ... + 2850056200.
Almost surely, 21140022400200 is an apocalyptic number.
1140022400200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1140022400200 is an abundant number, since it is smaller than the sum of its proper divisors (1510529680730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140022400200 is a wasteful number, since it uses less digits than its factorization.
1140022400200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5700112017 (or 5700112008 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 1140022400200 its reverse (20042200411), we get a palindrome (1160064600611).
The spelling of 1140022400200 in words is "one trillion, one hundred forty billion, twenty-two million, four hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •