Base | Representation |
---|---|
bin | 1101100001000011111… |
… | …1100100000101010111 |
3 | 211012101100100112000022 |
4 | 3120100333210011113 |
5 | 12301033103113221 |
6 | 254402145335355 |
7 | 22530314520512 |
oct | 3302077440527 |
9 | 735340315008 |
10 | 232213332311 |
11 | 8a532410594 |
12 | 3900793755b |
13 | 18b8910315c |
14 | b34c477d79 |
15 | 60915504ab |
hex | 3610fe4157 |
232213332311 has 8 divisors (see below), whose sum is σ = 245890216800. Its totient is φ = 218538367488.
The previous prime is 232213332293. The next prime is 232213332331. The reversal of 232213332311 is 113233312232.
232213332311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232213332311 - 214 = 232213315927 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232213332331) 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 7 ways as a sum of consecutive naturals, for example, 227051 + ... + 718316.
It is an arithmetic number, because the mean of its divisors is an integer number (30736277100).
Almost surely, 2232213332311 is an apocalyptic number.
232213332311 is a deficient number, since it is larger than the sum of its proper divisors (13676884489).
232213332311 is a wasteful number, since it uses less digits than its factorization.
232213332311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 959833.
The product of its digits is 3888, while the sum is 26.
Adding to 232213332311 its reverse (113233312232), we get a palindrome (345446644543).
The spelling of 232213332311 in words is "two hundred thirty-two billion, two hundred thirteen million, three hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •