Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …011001001011100001100100 |
3 | 222101001011102021211111000112 |
4 | 231232122311121023201210 |
5 | 202324323400003311322 |
6 | 1551412552341032152 |
7 | 60234066036665522 |
oct | 5556326531134144 |
9 | 871034367744015 |
10 | 201102002010212 |
11 | 59093975464236 |
12 | 1a67aab96b5658 |
13 | 8829ab6a66484 |
14 | 3793562d4b312 |
15 | 183b1d069d5e2 |
hex | b6e6b564b864 |
201102002010212 has 6 divisors (see below), whose sum is σ = 351928503517878. Its totient is φ = 100551001005104.
The previous prime is 201102002010209. The next prime is 201102002010223. The reversal of 201102002010212 is 212010200201102.
It can be written as a sum of positive squares in only one way, i.e., 201071946240256 + 30055769956 = 14179984^2 + 173366^2 .
It is a super-2 number, since 2×2011020020102122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25137750251273 + ... + 25137750251280.
It is an arithmetic number, because the mean of its divisors is an integer number (58654750586313).
Almost surely, 2201102002010212 is an apocalyptic number.
It is an amenable number.
201102002010212 is a deficient number, since it is larger than the sum of its proper divisors (150826501507666).
201102002010212 is a wasteful number, since it uses less digits than its factorization.
201102002010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50275500502557 (or 50275500502555 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201102002010212 its reverse (212010200201102), we get a palindrome (413112202211314).
The spelling of 201102002010212 in words is "two hundred one trillion, one hundred two billion, two million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •