Base | Representation |
---|---|
bin | 101101101110011001000101… |
… | …010010011101100111100010 |
3 | 222101000222120012202110222121 |
4 | 231232121011102131213202 |
5 | 202324311022011413442 |
6 | 1551412041552454454 |
7 | 60234001321245223 |
oct | 5556310522354742 |
9 | 871028505673877 |
10 | 201100121201122 |
11 | 5909309a826560 |
12 | 1a67a67384a42a |
13 | 88298771c19a0 |
14 | 379342523b24a |
15 | 183b1204d1967 |
hex | b6e64549d9e2 |
201100121201122 has 64 divisors (see below), whose sum is σ = 357940603722240. Its totient is φ = 83531606112000.
The previous prime is 201100121201113. The next prime is 201100121201123. The reversal of 201100121201122 is 221102121001102.
It is a super-2 number, since 2×2011001212011222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201100121201096 and 201100121201105.
It is not an unprimeable number, because it can be changed into a prime (201100121201123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228308668 + ... + 229187800.
It is an arithmetic number, because the mean of its divisors is an integer number (5592821933160).
Almost surely, 2201100121201122 is an apocalyptic number.
201100121201122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201100121201122 is a deficient number, since it is larger than the sum of its proper divisors (156840482521118).
201100121201122 is a wasteful number, since it uses less digits than its factorization.
201100121201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 887179.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201100121201122 its reverse (221102121001102), we get a palindrome (422202242202224).
The spelling of 201100121201122 in words is "two hundred one trillion, one hundred billion, one hundred twenty-one million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •