Base | Representation |
---|---|
bin | 1101100000101001011… |
… | …0111100101111110101 |
3 | 211012002120220101011010 |
4 | 3120022112330233311 |
5 | 12300321104202013 |
6 | 254343131502433 |
7 | 22524463431162 |
oct | 3301226745765 |
9 | 735076811133 |
10 | 232102022133 |
11 | 8a4855a4603 |
12 | 38b965b7a19 |
13 | 18b6c02c647 |
14 | b33b781069 |
15 | 60868b47c3 |
hex | 360a5bcbf5 |
232102022133 has 4 divisors (see below), whose sum is σ = 309469362848. Its totient is φ = 154734681420.
The previous prime is 232102022129. The next prime is 232102022177. The reversal of 232102022133 is 331220201232.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 232102022133 - 22 = 232102022129 is a prime.
It is a super-3 number, since 3×2321020221333 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232102026133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38683670353 + ... + 38683670358.
It is an arithmetic number, because the mean of its divisors is an integer number (77367340712).
Almost surely, 2232102022133 is an apocalyptic number.
It is an amenable number.
232102022133 is a deficient number, since it is larger than the sum of its proper divisors (77367340715).
232102022133 is an equidigital number, since it uses as much as digits as its factorization.
232102022133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77367340714.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 232102022133 its reverse (331220201232), we get a palindrome (563322223365).
The spelling of 232102022133 in words is "two hundred thirty-two billion, one hundred two million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •