Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1110010111001100010 |
3 | 102122221011121012202220 |
4 | 1301220123302321202 |
5 | 3444334331413442 |
6 | 132015015251510 |
7 | 11546360045346 |
oct | 1615033627142 |
9 | 378834535686 |
10 | 122011201122 |
11 | 47821162308 |
12 | 1b791379b96 |
13 | b675a83bc5 |
14 | 5c964b9626 |
15 | 329182beec |
hex | 1c686f2e62 |
122011201122 has 8 divisors (see below), whose sum is σ = 244022402256. Its totient is φ = 40670400372.
The previous prime is 122011201121. The next prime is 122011201129. The reversal of 122011201122 is 221102110221.
It is a sphenic number, since it is the product of 3 distinct primes.
122011201122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (122011201121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10167600088 + ... + 10167600099.
It is an arithmetic number, because the mean of its divisors is an integer number (30502800282).
Almost surely, 2122011201122 is an apocalyptic number.
122011201122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011201122 is a wasteful number, since it uses less digits than its factorization.
122011201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20335200192.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122011201122 its reverse (221102110221), we get a palindrome (343113311343).
Subtracting 122011201122 from its reverse (221102110221), we obtain a palindrome (99090909099).
The spelling of 122011201122 in words is "one hundred twenty-two billion, eleven million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •