Base | Representation |
---|---|
bin | 101101101100111101111001… |
… | …111111001101110010110010 |
3 | 222100200121212101110001202012 |
4 | 231230331321333031302302 |
5 | 202321210022100201320 |
6 | 1551255051241522522 |
7 | 60223634263153415 |
oct | 5554757177156262 |
9 | 870617771401665 |
10 | 201002221100210 |
11 | 5905562176a752 |
12 | 1a6636b11a3442 |
13 | 88205747661aa |
14 | 378c7b903bb7c |
15 | 18387e07de4c5 |
hex | b6cf79fcdcb2 |
201002221100210 has 32 divisors (see below), whose sum is σ = 362725829060400. Its totient is φ = 80196048801792.
The previous prime is 201002221100171. The next prime is 201002221100269. The reversal of 201002221100210 is 12001122200102.
201002221100210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 34128298015249 + 166873923084961 = 5841943^2 + 12917969^2 .
It is a super-2 number, since 2×2010022211002102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 140018402 + ... + 141446658.
Almost surely, 2201002221100210 is an apocalyptic number.
201002221100210 is a deficient number, since it is larger than the sum of its proper divisors (161723607960190).
201002221100210 is a wasteful number, since it uses less digits than its factorization.
201002221100210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1464110.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201002221100210 its reverse (12001122200102), we get a palindrome (213003343300312).
The spelling of 201002221100210 in words is "two hundred one trillion, two billion, two hundred twenty-one million, one hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •