Base | Representation |
---|---|
bin | 1011101001001011001… |
… | …0100101110101100100 |
3 | 201010022112001101211102 |
4 | 2322102302211311210 |
5 | 11234130443400312 |
6 | 231520523255232 |
7 | 20310650261312 |
oct | 2722262456544 |
9 | 633275041742 |
10 | 200031231332 |
11 | 77918462819 |
12 | 3292607a518 |
13 | 15b2a93575a |
14 | 99782d10b2 |
15 | 530b092ec2 |
hex | 2e92ca5d64 |
200031231332 has 12 divisors (see below), whose sum is σ = 352284303420. Its totient is φ = 99378573216.
The previous prime is 200031231331. The next prime is 200031231349. The reversal of 200031231332 is 233132130002.
200031231332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 35654502976 + 164376728356 = 188824^2 + 405434^2 .
It is not an unprimeable number, because it can be changed into a prime (200031231331) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 159259907 + ... + 159261162.
It is an arithmetic number, because the mean of its divisors is an integer number (29357025285).
Almost surely, 2200031231332 is an apocalyptic number.
It is an amenable number.
200031231332 is a deficient number, since it is larger than the sum of its proper divisors (152253072088).
200031231332 is a wasteful number, since it uses less digits than its factorization.
200031231332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318521230 (or 318521228 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 200031231332 its reverse (233132130002), we get a palindrome (433163361334).
The spelling of 200031231332 in words is "two hundred billion, thirty-one million, two hundred thirty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •