Base | Representation |
---|---|
bin | 1101100001000011011… |
… | …1011011100001100101 |
3 | 211012101012100012011120 |
4 | 3120100313123201211 |
5 | 12301032031400401 |
6 | 254402031524153 |
7 | 22530260430246 |
oct | 3302067334145 |
9 | 735335305146 |
10 | 232211200101 |
11 | 8a531194631 |
12 | 39007089659 |
13 | 18b888377aa |
14 | b34c080ccd |
15 | 609127d836 |
hex | 3610ddb865 |
232211200101 has 8 divisors (see below), whose sum is σ = 309650478720. Its totient is φ = 154789694112.
The previous prime is 232211200099. The next prime is 232211200121. The reversal of 232211200101 is 101002112232.
232211200101 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 not a de Polignac number, because 232211200101 - 21 = 232211200099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232211200121) 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, 4412640 + ... + 4464953.
It is an arithmetic number, because the mean of its divisors is an integer number (38706309840).
Almost surely, 2232211200101 is an apocalyptic number.
It is an amenable number.
232211200101 is a deficient number, since it is larger than the sum of its proper divisors (77439278619).
232211200101 is an equidigital number, since it uses as much as digits as its factorization.
232211200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8886315.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 232211200101 its reverse (101002112232), we get a palindrome (333213312333).
The spelling of 232211200101 in words is "two hundred thirty-two billion, two hundred eleven million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •