Base | Representation |
---|---|
bin | 101101101110101100101110… |
… | …111100100100110011001100 |
3 | 222101010000000201010112112021 |
4 | 231232230232330210303030 |
5 | 202330132230111413400 |
6 | 1551425451415015524 |
7 | 60235346231265154 |
oct | 5556545674446314 |
9 | 871100021115467 |
10 | 201121221201100 |
11 | 590a103816a872 |
12 | 1a68278206a5a4 |
13 | 882b85a74a285 |
14 | 3794467661764 |
15 | 183b957ad371a |
hex | b6eb2ef24ccc |
201121221201100 has 36 divisors (see below), whose sum is σ = 437648741031600. Its totient is φ = 80224397968960.
The previous prime is 201121221201071. The next prime is 201121221201119. The reversal of 201121221201100 is 1102122121102.
It is a super-2 number, since 2×2011212212011002 (a number of 29 digits) contains 22 as substring.
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, 2801095315 + ... + 2801167114.
It is an arithmetic number, because the mean of its divisors is an integer number (12156909473100).
Almost surely, 2201121221201100 is an apocalyptic number.
201121221201100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201121221201100 is an abundant number, since it is smaller than the sum of its proper divisors (236527519830500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201121221201100 is a wasteful number, since it uses less digits than its factorization.
201121221201100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5602262802 (or 5602262795 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201121221201100 its reverse (1102122121102), we get a palindrome (202223343322202).
The spelling of 201121221201100 in words is "two hundred one trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •