Base | Representation |
---|---|
bin | 11011100000111100011000… |
… | …110101010101100101000000 |
3 | 120212110112212000211011001202 |
4 | 123200330120311111211000 |
5 | 111330121233232400000 |
6 | 1105211424031520332 |
7 | 34326523240112312 |
oct | 3340743065254500 |
9 | 525415760734052 |
10 | 121011120200000 |
11 | 35615589665a38 |
12 | 116a49233890a8 |
13 | 526a3b84b6ac4 |
14 | 21c4d803157b2 |
15 | decb9c2a0dd5 |
hex | 6e0f18d55940 |
121011120200000 has 84 divisors (see below), whose sum is σ = 300145092039324. Its totient is φ = 48404448000000.
The previous prime is 121011120199999. The next prime is 121011120200017. The reversal of 121011120200000 is 2021110121.
It can be written as a sum of positive squares in 6 ways, for example, as 65288597778496 + 55722522421504 = 8080136^2 + 7464752^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 302327801 + ... + 302727800.
It is an arithmetic number, because the mean of its divisors is an integer number (3573155857611).
Almost surely, 2121011120200000 is an apocalyptic number.
121011120200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121011120200000 is an abundant number, since it is smaller than the sum of its proper divisors (179133971839324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121011120200000 is an frugal number, since it uses more digits than its factorization.
121011120200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605055638 (or 605055608 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121011120200000 its reverse (2021110121), we get a palindrome (121013141310121).
The spelling of 121011120200000 in words is "one hundred twenty-one trillion, eleven billion, one hundred twenty million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •