Base | Representation |
---|---|
bin | 1011101010011000000… |
… | …0011101110000101100 |
3 | 201011010222201020000210 |
4 | 2322212000131300230 |
5 | 11240311012312442 |
6 | 232012521422420 |
7 | 20321643541632 |
oct | 2724600356054 |
9 | 634128636023 |
10 | 200353635372 |
11 | 77a73449740 |
12 | 329b603aa10 |
13 | 15b7c678c87 |
14 | 99a9057352 |
15 | 532952a19c |
hex | 2ea601dc2c |
200353635372 has 48 divisors (see below), whose sum is σ = 510274848384. Its totient is φ = 60679440000.
The previous prime is 200353635359. The next prime is 200353635431. The reversal of 200353635372 is 273536353002.
It is a self number, because there is not a number n which added to its sum of digits gives 200353635372.
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, 183654 + ... + 659117.
It is an arithmetic number, because the mean of its divisors is an integer number (10630726008).
Almost surely, 2200353635372 is an apocalyptic number.
200353635372 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200353635372 is an abundant number, since it is smaller than the sum of its proper divisors (309921213012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200353635372 is a wasteful number, since it uses less digits than its factorization.
200353635372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844590 (or 844588 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 39.
Adding to 200353635372 its reverse (273536353002), we get a palindrome (473889988374).
The spelling of 200353635372 in words is "two hundred billion, three hundred fifty-three million, six hundred thirty-five thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •