Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …001111101100100001011010 |
3 | 222100200112020100211221001211 |
4 | 231230330331033230201122 |
5 | 202321200430203311302 |
6 | 1551254402155133334 |
7 | 60223600110063466 |
oct | 5554747517544132 |
9 | 870615210757054 |
10 | 201001202010202 |
11 | 59055149498300 |
12 | 1a663467a4424a |
13 | 88204415a3b59 |
14 | 378c71d9614a6 |
15 | 18387810dbad7 |
hex | b6cf3d3ec85a |
201001202010202 has 48 divisors (see below), whose sum is σ = 340609692407040. Its totient is φ = 88850707339680.
The previous prime is 201001202010157. The next prime is 201001202010209. The reversal of 201001202010202 is 202010202100102.
It is a happy number.
201001202010202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (201001202010209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54494502 + ... + 58065937.
It is an arithmetic number, because the mean of its divisors is an integer number (7096035258480).
Almost surely, 2201001202010202 is an apocalyptic number.
201001202010202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201001202010202 is a deficient number, since it is larger than the sum of its proper divisors (139608490396838).
201001202010202 is a wasteful number, since it uses less digits than its factorization.
201001202010202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112560667 (or 112560656 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201001202010202 its reverse (202010202100102), we get a palindrome (403011404110304).
The spelling of 201001202010202 in words is "two hundred one trillion, one billion, two hundred two million, ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •