Base | Representation |
---|---|
bin | 1101011101010010011… |
… | …0100000110000100011 |
3 | 211002202201211121122201 |
4 | 3113110212200300203 |
5 | 12241444213212011 |
6 | 254113433114031 |
7 | 22463232461233 |
oct | 3272446406043 |
9 | 732681747581 |
10 | 231200132131 |
11 | 8a0624a1271 |
12 | 38984558917 |
13 | 18a57223917 |
14 | b293a91cc3 |
15 | 6032612cc1 |
hex | 35d49a0c23 |
231200132131 has 16 divisors (see below), whose sum is σ = 234267437248. Its totient is φ = 228150172800.
The previous prime is 231200132101. The next prime is 231200132159. The reversal of 231200132131 is 131231002132.
It is a cyclic number.
It is not a de Polignac number, because 231200132131 - 27 = 231200132003 is a prime.
It is a super-2 number, since 2×2312001321312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231200132099 and 231200132108.
It is not an unprimeable number, because it can be changed into a prime (231200132101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36829765 + ... + 36836041.
It is an arithmetic number, because the mean of its divisors is an integer number (14641714828).
Almost surely, 2231200132131 is an apocalyptic number.
231200132131 is a deficient number, since it is larger than the sum of its proper divisors (3067305117).
231200132131 is a wasteful number, since it uses less digits than its factorization.
231200132131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7582.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 231200132131 its reverse (131231002132), we get a palindrome (362431134263).
The spelling of 231200132131 in words is "two hundred thirty-one billion, two hundred million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •