Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …000011000111110101000 |
3 | 10222011112211010112220202 |
4 | 100110002000120332220 |
5 | 121331322122333000 |
6 | 2214553423411332 |
7 | 143663631544103 |
oct | 20240200307650 |
9 | 3864484115822 |
10 | 1121020121000 |
11 | 3a24706a701a |
12 | 161317453b48 |
13 | 819339165b0 |
14 | 3c38705773a |
15 | 1e261074dd5 |
hex | 10502018fa8 |
1121020121000 has 128 divisors (see below), whose sum is σ = 2973654028800. Its totient is φ = 392130028800.
The previous prime is 1121020120991. The next prime is 1121020121099. The reversal of 1121020121000 is 1210201211.
It is a super-2 number, since 2×11210201210002 (a number of 25 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 2022272 + ... + 2516271.
It is an arithmetic number, because the mean of its divisors is an integer number (23231672100).
Almost surely, 21121020121000 is an apocalyptic number.
1121020121000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121020121000 is an abundant number, since it is smaller than the sum of its proper divisors (1852633907800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121020121000 is a wasteful number, since it uses less digits than its factorization.
1121020121000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4538596 (or 4538582 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1121020121000 its reverse (1210201211), we get a palindrome (1122230322211).
The spelling of 1121020121000 in words is "one trillion, one hundred twenty-one billion, twenty million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •