Base | Representation |
---|---|
bin | 1101100001000101110… |
… | …0110100010110100001 |
3 | 211012101212210010122022 |
4 | 3120101130310112201 |
5 | 12301042034013441 |
6 | 254403021551225 |
7 | 22530436640534 |
oct | 3302134642641 |
9 | 735355703568 |
10 | 232221001121 |
11 | 8a53677924a |
12 | 3900a415515 |
13 | 18b8a889905 |
14 | b34d4b2a1b |
15 | 609206784b |
hex | 36117345a1 |
232221001121 has 8 divisors (see below), whose sum is σ = 235183428480. Its totient is φ = 229262492592.
The previous prime is 232221001109. The next prime is 232221001151. The reversal of 232221001121 is 121100122232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232221001121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232221001121.
It is not an unprimeable number, because it can be changed into a prime (232221001151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 860345 + ... + 1097558.
It is an arithmetic number, because the mean of its divisors is an integer number (29397928560).
Almost surely, 2232221001121 is an apocalyptic number.
It is an amenable number.
232221001121 is a deficient number, since it is larger than the sum of its proper divisors (2962427359).
232221001121 is a wasteful number, since it uses less digits than its factorization.
232221001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1959415.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 232221001121 its reverse (121100122232), we get a palindrome (353321123353).
The spelling of 232221001121 in words is "two hundred thirty-two billion, two hundred twenty-one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •