Base | Representation |
---|---|
bin | 1011101101111010001… |
… | …1011000100100000110 |
3 | 201020121002211001101110 |
4 | 2323132203120210012 |
5 | 11244231343010342 |
6 | 232251011105450 |
7 | 20354313300363 |
oct | 2733643304406 |
9 | 636532731343 |
10 | 201302313222 |
11 | 7840a9a941a |
12 | 3301b8a2286 |
13 | 15ca108700a |
14 | 9a5904546a |
15 | 538296ec9c |
hex | 2ede8d8906 |
201302313222 has 16 divisors (see below), whose sum is σ = 402835102272. Its totient is φ = 67062358440.
The previous prime is 201302313203. The next prime is 201302313241. The reversal of 201302313222 is 222313203102.
It is a happy number.
201302313222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (201302313203) and next prime (201302313241).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 9591804 + ... + 9612767.
It is an arithmetic number, because the mean of its divisors is an integer number (25177193892).
Almost surely, 2201302313222 is an apocalyptic number.
201302313222 is an abundant number, since it is smaller than the sum of its proper divisors (201532789050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201302313222 is a wasteful number, since it uses less digits than its factorization.
201302313222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19206323.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 201302313222 its reverse (222313203102), we get a palindrome (423615516324).
The spelling of 201302313222 in words is "two hundred one billion, three hundred two million, three hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •