Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1011111111000110100 |
3 | 201020002011000101202012 |
4 | 2323102213133320310 |
5 | 11243324112041304 |
6 | 232215055103352 |
7 | 20346332231045 |
oct | 2732247377064 |
9 | 636064011665 |
10 | 201102065204 |
11 | 78317967097 |
12 | 32b84811b58 |
13 | 15c6b743b71 |
14 | 9a3a5da8cc |
15 | 53700b716e |
hex | 2ed29dfe34 |
201102065204 has 6 divisors (see below), whose sum is σ = 351928614114. Its totient is φ = 100551032600.
The previous prime is 201102065201. The next prime is 201102065249. The reversal of 201102065204 is 402560201102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 110077968400 + 91024096804 = 331780^2 + 301702^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 201102065204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102065201) by changing a digit.
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 as a sum of consecutive naturals, namely, 25137758147 + ... + 25137758154.
It is an arithmetic number, because the mean of its divisors is an integer number (58654769019).
Almost surely, 2201102065204 is an apocalyptic number.
It is an amenable number.
201102065204 is a deficient number, since it is larger than the sum of its proper divisors (150826548910).
201102065204 is a wasteful number, since it uses less digits than its factorization.
201102065204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50275516305 (or 50275516303 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 201102065204 its reverse (402560201102), we get a palindrome (603662266306).
The spelling of 201102065204 in words is "two hundred one billion, one hundred two million, sixty-five thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •