Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …111111100000000011001100 |
3 | 222101001001220000010222002212 |
4 | 231232121322333200003030 |
5 | 202324314343140400022 |
6 | 1551412311220205552 |
7 | 60234032541514154 |
oct | 5556317277400314 |
9 | 871031800128085 |
10 | 201101022200012 |
11 | 59093512380340 |
12 | 1a67a8855398b8 |
13 | 882998ba77c1c |
14 | 37934acb77764 |
15 | 183b1746593e2 |
hex | b6e67afe00cc |
201101022200012 has 24 divisors (see below), whose sum is σ = 384194558092800. Its totient is φ = 91344216306960.
The previous prime is 201101022199993. The next prime is 201101022200047. The reversal of 201101022200012 is 210002220101102.
It is a super-2 number, since 2×2011010222000122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201101022200012.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1633418708 + ... + 1633541819.
It is an arithmetic number, because the mean of its divisors is an integer number (16008106587200).
Almost surely, 2201101022200012 is an apocalyptic number.
201101022200012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201101022200012 is a deficient number, since it is larger than the sum of its proper divisors (183093535892788).
201101022200012 is a wasteful number, since it uses less digits than its factorization.
201101022200012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3266961941 (or 3266961939 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201101022200012 its reverse (210002220101102), we get a palindrome (411103242301114).
The spelling of 201101022200012 in words is "two hundred one trillion, one hundred one billion, twenty-two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •