Base | Representation |
---|---|
bin | 101101101111110110100111… |
… | …010111110100010111101101 |
3 | 222101101120210100011212220111 |
4 | 231233312213113310113231 |
5 | 202332432212030120023 |
6 | 1551530131312220021 |
7 | 60244155134521066 |
oct | 5557664727642755 |
9 | 871346710155814 |
10 | 201200551020013 |
11 | 59121746843986 |
12 | 1a69602153a611 |
13 | 8836190a8341c |
14 | 37982313c556d |
15 | 183da4c32000d |
hex | b6fda75f45ed |
201200551020013 has 8 divisors (see below), whose sum is σ = 215954177244408. Its totient is φ = 186771180317184.
The previous prime is 201200551019947. The next prime is 201200551020083. The reversal of 201200551020013 is 310020155002102.
It can be written as a sum of positive squares in 4 ways, for example, as 69008458679689 + 132192092340324 = 8307133^2 + 11497482^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201200551020013 - 217 = 201200550888941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200551020083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81063879106 + ... + 81063881587.
It is an arithmetic number, because the mean of its divisors is an integer number (26994272155551).
Almost surely, 2201200551020013 is an apocalyptic number.
It is an amenable number.
201200551020013 is a deficient number, since it is larger than the sum of its proper divisors (14753626224395).
201200551020013 is a wasteful number, since it uses less digits than its factorization.
201200551020013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162127760783.
The product of its (nonzero) digits is 600, while the sum is 22.
The spelling of 201200551020013 in words is "two hundred one trillion, two hundred billion, five hundred fifty-one million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •