Base | Representation |
---|---|
bin | 1101011110011110110… |
… | …1100100111000000000 |
3 | 211010121002010202012111 |
4 | 3113213231210320000 |
5 | 12243123303013404 |
6 | 254205325105104 |
7 | 22504204625356 |
oct | 3274755447000 |
9 | 733532122174 |
10 | 231520751104 |
11 | 8a207479025 |
12 | 38a539b8194 |
13 | 18aa87907a6 |
14 | b2c44b17d6 |
15 | 6050846104 |
hex | 35e7b64e00 |
231520751104 has 80 divisors (see below), whose sum is σ = 506690672400. Its totient is φ = 105193897984.
The previous prime is 231520751047. The next prime is 231520751107. The reversal of 231520751104 is 401157025132.
231520751104 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231520751107) 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 7 ways as a sum of consecutive naturals, for example, 206194 + ... + 711025.
It is an arithmetic number, because the mean of its divisors is an integer number (6333633405).
Almost surely, 2231520751104 is an apocalyptic number.
It is an amenable number.
231520751104 is an abundant number, since it is smaller than the sum of its proper divisors (275169921296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231520751104 is an equidigital number, since it uses as much as digits as its factorization.
231520751104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 917283 (or 917267 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 31.
Adding to 231520751104 its reverse (401157025132), we get a palindrome (632677776236).
The spelling of 231520751104 in words is "two hundred thirty-one billion, five hundred twenty million, seven hundred fifty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •