Base | Representation |
---|---|
bin | 1011101001100011010… |
… | …0001001000011011100 |
3 | 201010120120020021101012 |
4 | 2322120310021003130 |
5 | 11234332332113040 |
6 | 231534533434352 |
7 | 20313315330161 |
oct | 2723064110334 |
9 | 633516207335 |
10 | 200132301020 |
11 | 7796a514993 |
12 | 32953a9b9b8 |
13 | 15b458620c2 |
14 | 99878c0068 |
15 | 5314da9865 |
hex | 2e98d090dc |
200132301020 has 12 divisors (see below), whose sum is σ = 420277832184. Its totient is φ = 80052920400.
The previous prime is 200132301011. The next prime is 200132301043. The reversal of 200132301020 is 20103231002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200132300986 and 200132301004.
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 3 ways as a sum of consecutive naturals, for example, 5003307506 + ... + 5003307545.
It is an arithmetic number, because the mean of its divisors is an integer number (35023152682).
Almost surely, 2200132301020 is an apocalyptic number.
200132301020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200132301020 is an abundant number, since it is smaller than the sum of its proper divisors (220145531164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200132301020 is a wasteful number, since it uses less digits than its factorization.
200132301020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10006615060 (or 10006615058 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 200132301020 its reverse (20103231002), we get a palindrome (220235532022).
The spelling of 200132301020 in words is "two hundred billion, one hundred thirty-two million, three hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •