Base | Representation |
---|---|
bin | 1101100000101001001… |
… | …1011110010110111111 |
3 | 211012002112012002122000 |
4 | 3120022103132112333 |
5 | 12300320341024411 |
6 | 254343100153343 |
7 | 22524452615403 |
oct | 3301223362677 |
9 | 735075162560 |
10 | 232101111231 |
11 | 8a4850321a0 |
12 | 38b96238853 |
13 | 18b6baa0b52 |
14 | b33b5c5103 |
15 | 6086784956 |
hex | 360a4de5bf |
232101111231 has 64 divisors (see below), whose sum is σ = 397352563200. Its totient is φ = 132334732800.
The previous prime is 232101111173. The next prime is 232101111247. The reversal of 232101111231 is 132111101232.
232101111231 is a `hidden beast` number, since 2 + 321 + 0 + 1 + 111 + 231 = 666.
It is not a de Polignac number, because 232101111231 - 26 = 232101111167 is a prime.
It is a super-2 number, since 2×2321011112312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232101119231) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13224660 + ... + 13242198.
It is an arithmetic number, because the mean of its divisors is an integer number (6208633800).
Almost surely, 2232101111231 is an apocalyptic number.
232101111231 is a deficient number, since it is larger than the sum of its proper divisors (165251451969).
232101111231 is a wasteful number, since it uses less digits than its factorization.
232101111231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20197 (or 20191 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 232101111231 its reverse (132111101232), we get a palindrome (364212212463).
Subtracting from 232101111231 its reverse (132111101232), we obtain a palindrome (99990009999).
The spelling of 232101111231 in words is "two hundred thirty-two billion, one hundred one million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •