Base | Representation |
---|---|
bin | 101101101100111101111001… |
… | …011100100010110011001010 |
3 | 222100200121211202100021222120 |
4 | 231230331321130202303022 |
5 | 202321210012233324320 |
6 | 1551255050315032110 |
7 | 60223634123000031 |
oct | 5554757134426312 |
9 | 870617752307876 |
10 | 201002212011210 |
11 | 59055617621a85 |
12 | 1a6636aa13b636 |
13 | 882057290319c |
14 | 378c7b7b53718 |
15 | 18387deae6440 |
hex | b6cf79722cca |
201002212011210 has 64 divisors (see below), whose sum is σ = 482656869459072. Its totient is φ = 53572644193536.
The previous prime is 201002212011187. The next prime is 201002212011257. The reversal of 201002212011210 is 12110212200102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 201002212011210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 602236797 + ... + 602570463.
It is an arithmetic number, because the mean of its divisors is an integer number (7541513585298).
Almost surely, 2201002212011210 is an apocalyptic number.
201002212011210 is an abundant number, since it is smaller than the sum of its proper divisors (281654657447862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201002212011210 is a wasteful number, since it uses less digits than its factorization.
201002212011210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344087.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201002212011210 its reverse (12110212200102), we get a palindrome (213112424211312).
It can be divided in two parts, 201002 and 212011210, that added together give a palindrome (212212212).
The spelling of 201002212011210 in words is "two hundred one trillion, two billion, two hundred twelve million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •