Base | Representation |
---|---|
bin | 101101100010110001000100… |
… | …011001110110011001000100 |
3 | 222021012121111222102202011020 |
4 | 231202301010121312121010 |
5 | 202223213421031141312 |
6 | 1550001042004311140 |
7 | 60122200340661012 |
oct | 5542610431663104 |
9 | 867177458382136 |
10 | 200301242443332 |
11 | 58905309575718 |
12 | 1a56b8809a24b0 |
13 | 879c431622954 |
14 | 37668bbb838b2 |
15 | 182546586e78c |
hex | b62c44676644 |
200301242443332 has 12 divisors (see below), whose sum is σ = 467369565701136. Its totient is φ = 66767080814440.
The previous prime is 200301242443321. The next prime is 200301242443381. The reversal of 200301242443332 is 233344242103002.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 200301242443293 and 200301242443302.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8345885101794 + ... + 8345885101817.
It is an arithmetic number, because the mean of its divisors is an integer number (38947463808428).
Almost surely, 2200301242443332 is an apocalyptic number.
It is an amenable number.
200301242443332 is an abundant number, since it is smaller than the sum of its proper divisors (267068323257804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200301242443332 is a wasteful number, since it uses less digits than its factorization.
200301242443332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16691770203618 (or 16691770203616 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 200301242443332 its reverse (233344242103002), we get a palindrome (433645484546334).
The spelling of 200301242443332 in words is "two hundred trillion, three hundred one billion, two hundred forty-two million, four hundred forty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •