Base | Representation |
---|---|
bin | 1101100000010110010… |
… | …1101111000100110011 |
3 | 211011220000100110011200 |
4 | 3120011211233010303 |
5 | 12300140113342321 |
6 | 254331152542243 |
7 | 22522502364123 |
oct | 3300545570463 |
9 | 734800313150 |
10 | 232022012211 |
11 | 8a444416a00 |
12 | 38b73851983 |
13 | 18b585978b2 |
14 | b330cb4c83 |
15 | 607e85cd26 |
hex | 360596f133 |
232022012211 has 18 divisors (see below), whose sum is σ = 368380221300. Its totient is φ = 140619400680.
The previous prime is 232022012153. The next prime is 232022012213. The reversal of 232022012211 is 112210220232.
232022012211 is a `hidden beast` number, since 2 + 320 + 220 + 122 + 1 + 1 = 666.
232022012211 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 232022012211 - 27 = 232022012083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (232022012213) 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 17 ways as a sum of consecutive naturals, for example, 106528761 + ... + 106530938.
It is an arithmetic number, because the mean of its divisors is an integer number (20465567850).
Almost surely, 2232022012211 is an apocalyptic number.
232022012211 is a deficient number, since it is larger than the sum of its proper divisors (136358209089).
232022012211 is a wasteful number, since it uses less digits than its factorization.
232022012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213059727 (or 213059713 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 232022012211 its reverse (112210220232), we get a palindrome (344232232443).
The spelling of 232022012211 in words is "two hundred thirty-two billion, twenty-two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •