Base | Representation |
---|---|
bin | 101101100001110000111000… |
… | …100000001100001110101000 |
3 | 222020222000121212220122001201 |
4 | 231201300320200030032220 |
5 | 202221101244231133222 |
6 | 1545505243124053544 |
7 | 60114210426643510 |
oct | 5541607040141650 |
9 | 866860555818051 |
10 | 200232323302312 |
11 | 58889062504a34 |
12 | 1a55a447b342b4 |
13 | 8795a9a0b6832 |
14 | 3763420926840 |
15 | 18237800b3427 |
hex | b61c3880c3a8 |
200232323302312 has 32 divisors (see below), whose sum is σ = 440665730824320. Its totient is φ = 83494559522880.
The previous prime is 200232323302309. The next prime is 200232323302327. The reversal of 200232323302312 is 213203323232002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48318608764 + ... + 48318612907.
It is an arithmetic number, because the mean of its divisors is an integer number (13770804088260).
Almost surely, 2200232323302312 is an apocalyptic number.
It is an amenable number.
200232323302312 is an abundant number, since it is smaller than the sum of its proper divisors (240433407522008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200232323302312 is a wasteful number, since it uses less digits than its factorization.
200232323302312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96637221721 (or 96637221717 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 200232323302312 its reverse (213203323232002), we get a palindrome (413435646534314).
The spelling of 200232323302312 in words is "two hundred trillion, two hundred thirty-two billion, three hundred twenty-three million, three hundred two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •