Base | Representation |
---|---|
bin | 1011101010111011011… |
… | …0110101010011101111 |
3 | 201011112100002021112000 |
4 | 2322232312311103233 |
5 | 11241112014332302 |
6 | 232035343543343 |
7 | 20325425526636 |
oct | 2725666652357 |
9 | 634470067460 |
10 | 200502105327 |
11 | 7803a236387 |
12 | 32a378bab53 |
13 | 15ba4360614 |
14 | 99c0a6451d |
15 | 53375a631c |
hex | 2eaedb54ef |
200502105327 has 16 divisors (see below), whose sum is σ = 303360161280. Its totient is φ = 130824067896.
The previous prime is 200502105317. The next prime is 200502105341. The reversal of 200502105327 is 723501205002.
200502105327 is a `hidden beast` number, since 20 + 0 + 502 + 105 + 32 + 7 = 666.
It is not a de Polignac number, because 200502105327 - 211 = 200502103279 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 200502105327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200502105317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78998773 + ... + 79001310.
It is an arithmetic number, because the mean of its divisors is an integer number (18960010080).
Almost surely, 2200502105327 is an apocalyptic number.
200502105327 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
200502105327 is a deficient number, since it is larger than the sum of its proper divisors (102858055953).
200502105327 is a wasteful number, since it uses less digits than its factorization.
200502105327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158000139 (or 158000133 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The spelling of 200502105327 in words is "two hundred billion, five hundred two million, one hundred five thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •