Base | Representation |
---|---|
bin | 101101110000001000110101… |
… | …110101011111101000000110 |
3 | 222101110110022012121120011112 |
4 | 231300020311311133220012 |
5 | 202333242301441030342 |
6 | 1551543125241405022 |
7 | 60245450116061144 |
oct | 5560106565375006 |
9 | 871413265546145 |
10 | 201220121033222 |
11 | 59129a79586515 |
12 | 1a699983499772 |
13 | 8837c8c34a7b5 |
14 | 379916a53c594 |
15 | 183e2e5452682 |
hex | b70235d5fa06 |
201220121033222 has 4 divisors (see below), whose sum is σ = 301830181549836. Its totient is φ = 100610060516610.
The previous prime is 201220121033213. The next prime is 201220121033231. The reversal of 201220121033222 is 222330121022102.
It is a happy number.
201220121033222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (201220121033213) and next prime (201220121033231).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50305030258304 + ... + 50305030258307.
It is an arithmetic number, because the mean of its divisors is an integer number (75457545387459).
Almost surely, 2201220121033222 is an apocalyptic number.
201220121033222 is a deficient number, since it is larger than the sum of its proper divisors (100610060516614).
201220121033222 is a wasteful number, since it uses less digits than its factorization.
201220121033222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100610060516613.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 201220121033222 its reverse (222330121022102), we get a palindrome (423550242055324).
The spelling of 201220121033222 in words is "two hundred one trillion, two hundred twenty billion, one hundred twenty-one million, thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •