Base | Representation |
---|---|
bin | 1101100000101001101… |
… | …1110101100000101011 |
3 | 211012002200022110110110 |
4 | 3120022123311200223 |
5 | 12300321421200321 |
6 | 254343215145403 |
7 | 22524510345123 |
oct | 3301233654053 |
9 | 735080273413 |
10 | 232103303211 |
11 | 8a48629a04a |
12 | 38b96b15263 |
13 | 18b6c38a790 |
14 | b33b9d5c83 |
15 | 6086a69176 |
hex | 360a6f582b |
232103303211 has 32 divisors (see below), whose sum is σ = 353168944128. Its totient is φ = 134321195520.
The previous prime is 232103303161. The next prime is 232103303293. The reversal of 232103303211 is 112303301232.
232103303211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 232103303211 - 26 = 232103303147 is a prime.
It is a super-2 number, since 2×2321033032112 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (232103303711) 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 31 ways as a sum of consecutive naturals, for example, 673960 + ... + 958346.
It is an arithmetic number, because the mean of its divisors is an integer number (11036529504).
Almost surely, 2232103303211 is an apocalyptic number.
232103303211 is a deficient number, since it is larger than the sum of its proper divisors (121065640917).
232103303211 is a wasteful number, since it uses less digits than its factorization.
232103303211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285651.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 232103303211 its reverse (112303301232), we get a palindrome (344406604443).
The spelling of 232103303211 in words is "two hundred thirty-two billion, one hundred three million, three hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •