Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …110101111000010111101000 |
3 | 222100200112021001200111012111 |
4 | 231230330331311320113220 |
5 | 202321200440234121300 |
6 | 1551254403153452104 |
7 | 60223600261134244 |
oct | 5554747565702750 |
9 | 870615231614174 |
10 | 201001212020200 |
11 | 59055154104a29 |
12 | 1a66346b271034 |
13 | 882044369a127 |
14 | 378c721009424 |
15 | 1838781e179ba |
hex | b6cf3dd785e8 |
201001212020200 has 48 divisors (see below), whose sum is σ = 473909899923360. Its totient is φ = 79268083608000.
The previous prime is 201001212020197. The next prime is 201001212020237. The reversal of 201001212020200 is 2020212100102.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7077493266 + ... + 7077521665.
It is an arithmetic number, because the mean of its divisors is an integer number (9873122915070).
Almost surely, 2201001212020200 is an apocalyptic number.
201001212020200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201001212020200 is an abundant number, since it is smaller than the sum of its proper divisors (272908687903160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001212020200 is a wasteful number, since it uses less digits than its factorization.
201001212020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14155015018 (or 14155015009 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201001212020200 its reverse (2020212100102), we get a palindrome (203021424120302).
The spelling of 201001212020200 in words is "two hundred one trillion, one billion, two hundred twelve million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •