Base | Representation |
---|---|
bin | 1011101101101110000… |
… | …1101101010000110000 |
3 | 201020110120021121110012 |
4 | 2323123201231100300 |
5 | 11244130343321224 |
6 | 232241554554052 |
7 | 20353125611456 |
oct | 2733341552060 |
9 | 636416247405 |
10 | 201251542064 |
11 | 78394281291 |
12 | 33006898928 |
13 | 15c936bb901 |
14 | 9a523ca9d6 |
15 | 537d29180e |
hex | 2edb86d430 |
201251542064 has 10 divisors (see below), whose sum is σ = 389924862780. Its totient is φ = 100625771024.
The previous prime is 201251542057. The next prime is 201251542073. The reversal of 201251542064 is 460245152102.
201251542064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2012515420642 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201251542064.
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 as a sum of consecutive naturals, namely, 6289110674 + ... + 6289110705.
It is an arithmetic number, because the mean of its divisors is an integer number (38992486278).
Almost surely, 2201251542064 is an apocalyptic number.
It is an amenable number.
201251542064 is a deficient number, since it is larger than the sum of its proper divisors (188673320716).
201251542064 is a wasteful number, since it uses less digits than its factorization.
201251542064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12578221387 (or 12578221381 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 201251542064 its reverse (460245152102), we get a palindrome (661496694166).
The spelling of 201251542064 in words is "two hundred one billion, two hundred fifty-one million, five hundred forty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •