Base | Representation |
---|---|
bin | 1011101101100111000… |
… | …1110111000011010001 |
3 | 201020101112002222221010 |
4 | 2323121301313003101 |
5 | 11244100342101113 |
6 | 232235030321133 |
7 | 20352321444360 |
oct | 2733161670321 |
9 | 636345088833 |
10 | 201222222033 |
11 | 78379775758 |
12 | 32bb8ab91a9 |
13 | 15c8a5c4291 |
14 | 9a4c5577d7 |
15 | 537a8ee1c3 |
hex | 2ed9c770d1 |
201222222033 has 8 divisors (see below), whose sum is σ = 306624338368. Its totient is φ = 114984126864.
The previous prime is 201222221999. The next prime is 201222222041. The reversal of 201222222033 is 330222222102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201222222033 - 221 = 201220124881 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 9582010573 = 201222222033 / (2 + 0 + 1 + 2 + 2 + 2 + 2 + 2 + 2 + 0 + 3 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201222222053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4791005266 + ... + 4791005307.
It is an arithmetic number, because the mean of its divisors is an integer number (38328042296).
Almost surely, 2201222222033 is an apocalyptic number.
It is an amenable number.
201222222033 is a deficient number, since it is larger than the sum of its proper divisors (105402116335).
201222222033 is an equidigital number, since it uses as much as digits as its factorization.
201222222033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9582010583.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 201222222033 its reverse (330222222102), we get a palindrome (531444444135).
The spelling of 201222222033 in words is "two hundred one billion, two hundred twenty-two million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •