Base | Representation |
---|---|
bin | 1101100000011000010… |
… | …0101000001000001101 |
3 | 211011220120120212112222 |
4 | 3120012010220020031 |
5 | 12300144202011341 |
6 | 254332042305125 |
7 | 22522631252360 |
oct | 3300604501015 |
9 | 734816525488 |
10 | 232030110221 |
11 | 8a448a48078 |
12 | 38b764b81a5 |
13 | 18b5a171810 |
14 | b331dc20d7 |
15 | 608040c44b |
hex | 360612820d |
232030110221 has 128 divisors (see below), whose sum is σ = 316036546560. Its totient is φ = 165193113600.
The previous prime is 232030110217. The next prime is 232030110223. The reversal of 232030110221 is 122011030232.
It is a cyclic number.
It is not a de Polignac number, because 232030110221 - 22 = 232030110217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 232030110221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232030110223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1214817236 + ... + 1214817426.
It is an arithmetic number, because the mean of its divisors is an integer number (2469035520).
Almost surely, 2232030110221 is an apocalyptic number.
It is an amenable number.
232030110221 is a deficient number, since it is larger than the sum of its proper divisors (84006436339).
232030110221 is a wasteful number, since it uses less digits than its factorization.
232030110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 232030110221 its reverse (122011030232), we get a palindrome (354041140453).
The spelling of 232030110221 in words is "two hundred thirty-two billion, thirty million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •