Base | Representation |
---|---|
bin | 10000010100000000110… |
… | …100100000110100111000 |
3 | 10222011111102200222212110 |
4 | 100110000310200310320 |
5 | 121331302024331300 |
6 | 2214551433212320 |
7 | 143663300511324 |
oct | 20240064406470 |
9 | 3864442628773 |
10 | 1121000230200 |
11 | 3a2460450844 |
12 | 1613108610a0 |
13 | 8192c770aa6 |
14 | 3c38455a984 |
15 | 1e25e446550 |
hex | 10500d20d38 |
1121000230200 has 96 divisors (see below), whose sum is σ = 3488622986160. Its totient is φ = 297770188800.
The previous prime is 1121000230199. The next prime is 1121000230247. The reversal of 1121000230200 is 20320001211.
It is a super-2 number, since 2×11210002302002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3480691 + ... + 3789090.
Almost surely, 21121000230200 is an apocalyptic number.
1121000230200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121000230200 is an abundant number, since it is smaller than the sum of its proper divisors (2367622755960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121000230200 is a wasteful number, since it uses less digits than its factorization.
1121000230200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7270057 (or 7270048 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1121000230200 its reverse (20320001211), we get a palindrome (1141320231411).
The spelling of 1121000230200 in words is "one trillion, one hundred twenty-one billion, two hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •