Base | Representation |
---|---|
bin | 101101100011001111100101… |
… | …000101100100111111000000 |
3 | 222021022202002010021002021002 |
4 | 231203033211011210333000 |
5 | 202224233014234011000 |
6 | 1550024100453351132 |
7 | 60124440231251225 |
oct | 5543174505447700 |
9 | 867282063232232 |
10 | 200334003032000 |
11 | 589181a0018892 |
12 | 1a5760a43384a8 |
13 | 87a25528c6366 |
14 | 3768308ab394c |
15 | 18262319ea8d5 |
hex | b633e5164fc0 |
200334003032000 has 112 divisors (see below), whose sum is σ = 497278274163840. Its totient is φ = 79947675008000.
The previous prime is 200334003031969. The next prime is 200334003032017. The reversal of 200334003032000 is 230300433002.
200334003032000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25602755 + ... + 32498754.
Almost surely, 2200334003032000 is an apocalyptic number.
200334003032000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200334003032000 is an abundant number, since it is smaller than the sum of its proper divisors (296944271131840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200334003032000 is an equidigital number, since it uses as much as digits as its factorization.
200334003032000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58101967 (or 58101947 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 200334003032000 its reverse (230300433002), we get a palindrome (200564303465002).
The spelling of 200334003032000 in words is "two hundred trillion, three hundred thirty-four billion, three million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •