Base | Representation |
---|---|
bin | 1011101110000100000… |
… | …0101100100001110110 |
3 | 201020200222102011211000 |
4 | 2323201000230201312 |
5 | 11244322422122411 |
6 | 232255043024130 |
7 | 20355323644041 |
oct | 2734100544166 |
9 | 636628364730 |
10 | 201343551606 |
11 | 7843120542a |
12 | 3303166b046 |
13 | 15ca9795422 |
14 | 9a606dbc58 |
15 | 53863b8956 |
hex | 2ee102c876 |
201343551606 has 32 divisors (see below), whose sum is σ = 447446970720. Its totient is φ = 67111988832.
The previous prime is 201343551599. The next prime is 201343551613. The reversal of 201343551606 is 606155343102.
201343551606 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 43 + 5 + 5 + 1 + 606 = 666.
It is an interprime number because it is at equal distance from previous prime (201343551599) and next prime (201343551613).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1866316 + ... + 1971248.
It is an arithmetic number, because the mean of its divisors is an integer number (13982717835).
Almost surely, 2201343551606 is an apocalyptic number.
201343551606 is an abundant number, since it is smaller than the sum of its proper divisors (246103419114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201343551606 is a wasteful number, since it uses less digits than its factorization.
201343551606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140477 (or 140471 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 201343551606 its reverse (606155343102), we get a palindrome (807498894708).
The spelling of 201343551606 in words is "two hundred one billion, three hundred forty-three million, five hundred fifty-one thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •