Base | Representation |
---|---|
bin | 101101101101000101010000… |
… | …001101000011111001011010 |
3 | 222100201101020011211202220110 |
4 | 231231011100031003321122 |
5 | 202321322201131134320 |
6 | 1551302434132505150 |
7 | 60224333624656200 |
oct | 5555052015037132 |
9 | 870641204752813 |
10 | 201010110021210 |
11 | 590589aa869876 |
12 | 1a66513317b1b6 |
13 | 8821230c86a99 |
14 | 378cd26a6d070 |
15 | 1838b031975e0 |
hex | b6d150343e5a |
201010110021210 has 48 divisors (see below), whose sum is σ = 561187409206176. Its totient is φ = 45945168004512.
The previous prime is 201010110021199. The next prime is 201010110021241. The reversal of 201010110021210 is 12120011010102.
201010110021210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 68370784252 + ... + 68370787191.
It is an arithmetic number, because the mean of its divisors is an integer number (11691404358462).
Almost surely, 2201010110021210 is an apocalyptic number.
201010110021210 is an abundant number, since it is smaller than the sum of its proper divisors (360177299184966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201010110021210 is a wasteful number, since it uses less digits than its factorization.
201010110021210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136741571467 (or 136741571460 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201010110021210 its reverse (12120011010102), we get a palindrome (213130121031312).
The spelling of 201010110021210 in words is "two hundred one trillion, ten billion, one hundred ten million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •