Base | Representation |
---|---|
bin | 1011101110000100100… |
… | …0010000110001111100 |
3 | 201020201010010221122202 |
4 | 2323201020100301330 |
5 | 11244323424110400 |
6 | 232255153331032 |
7 | 20355346544603 |
oct | 2734110206174 |
9 | 636633127582 |
10 | 201345535100 |
11 | 7843233a686 |
12 | 33032266a78 |
13 | 15caa00b1a8 |
14 | 9a60a96a3a |
15 | 538665b4d5 |
hex | 2ee1210c7c |
201345535100 has 72 divisors (see below), whose sum is σ = 456244131840. Its totient is φ = 76981164480.
The previous prime is 201345535081. The next prime is 201345535109. The reversal of 201345535100 is 1535543102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201345535109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3242141 + ... + 3303659.
Almost surely, 2201345535100 is an apocalyptic number.
201345535100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201345535100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228122065920).
201345535100 is an abundant number, since it is smaller than the sum of its proper divisors (254898596740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201345535100 is a wasteful number, since it uses less digits than its factorization.
201345535100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62979 (or 62972 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 29.
The spelling of 201345535100 in words is "two hundred one billion, three hundred forty-five million, five hundred thirty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •