Base | Representation |
---|---|
bin | 1011101010010001110… |
… | …0111000010100101000 |
3 | 201011002011120220212120 |
4 | 2322210130320110220 |
5 | 11240232321423033 |
6 | 232010150111240 |
7 | 20321205623202 |
oct | 2724434702450 |
9 | 634064526776 |
10 | 200327529768 |
11 | 77a5a739163 |
12 | 329a934b520 |
13 | 15b77138782 |
14 | 99a57bd772 |
15 | 53270c01b3 |
hex | 2ea4738528 |
200327529768 has 32 divisors (see below), whose sum is σ = 506852791200. Its totient is φ = 65971314368.
The previous prime is 200327529709. The next prime is 200327529793. The reversal of 200327529768 is 867925723002.
200327529768 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2003275297682 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200327529768.
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 7 ways as a sum of consecutive naturals, for example, 50281023 + ... + 50285006.
It is an arithmetic number, because the mean of its divisors is an integer number (15839149725).
Almost surely, 2200327529768 is an apocalyptic number.
It is an amenable number.
200327529768 is an abundant number, since it is smaller than the sum of its proper divisors (306525261432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200327529768 is a wasteful number, since it uses less digits than its factorization.
200327529768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100566121 (or 100566117 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 51.
The spelling of 200327529768 in words is "two hundred billion, three hundred twenty-seven million, five hundred twenty-nine thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •