Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …1101001110011001011 |
3 | 201020010120120021202202 |
4 | 2323103311221303023 |
5 | 11243344333144120 |
6 | 232221110150415 |
7 | 20350001331245 |
oct | 2732365516313 |
9 | 636116507682 |
10 | 201122553035 |
11 | 7832848a988 |
12 | 32b8b65240b |
13 | 15c72a68341 |
14 | 9a3d211095 |
15 | 5371cb2875 |
hex | 2ed3d69ccb |
201122553035 has 4 divisors (see below), whose sum is σ = 241347063648. Its totient is φ = 160898042424.
The previous prime is 201122553001. The next prime is 201122553053. The reversal of 201122553035 is 530355221102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201122553035 - 28 = 201122552779 is a prime.
It is a super-2 number, since 2×2011225530352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201122552989 and 201122553007.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20112255299 + ... + 20112255308.
It is an arithmetic number, because the mean of its divisors is an integer number (60336765912).
Almost surely, 2201122553035 is an apocalyptic number.
201122553035 is a deficient number, since it is larger than the sum of its proper divisors (40224510613).
201122553035 is an equidigital number, since it uses as much as digits as its factorization.
201122553035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40224510612.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 201122553035 its reverse (530355221102), we get a palindrome (731477774137).
The spelling of 201122553035 in words is "two hundred one billion, one hundred twenty-two million, five hundred fifty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •