Base | Representation |
---|---|
bin | 110100110000001101000101… |
… | …111001101001100110011100 |
3 | 1010102111000222021111122220010 |
4 | 310300031011321221212130 |
5 | 220402232022320300012 |
6 | 2141240215335523220 |
7 | 66604146066240432 |
oct | 6460150571514634 |
9 | 1112430867448803 |
10 | 232011011103132 |
11 | 67a20354286a18 |
12 | 22031356229510 |
13 | 9c5c710276821 |
14 | 414156ddc0d52 |
15 | 1bc5213879c3c |
hex | d30345e6999c |
232011011103132 has 96 divisors (see below), whose sum is σ = 562516116664320. Its totient is φ = 74374476549120.
The previous prime is 232011011103121. The next prime is 232011011103149. The reversal of 232011011103132 is 231301110110232.
It is a junction number, because it is equal to n+sod(n) for n = 232011011103099 and 232011011103108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30161469 + ... + 37063947.
It is an arithmetic number, because the mean of its divisors is an integer number (5859542881920).
Almost surely, 2232011011103132 is an apocalyptic number.
It is an amenable number.
232011011103132 is an abundant number, since it is smaller than the sum of its proper divisors (330505105561188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232011011103132 is a wasteful number, since it uses less digits than its factorization.
232011011103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6903571 (or 6903569 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 232011011103132 its reverse (231301110110232), we get a palindrome (463312121213364).
The spelling of 232011011103132 in words is "two hundred thirty-two trillion, eleven billion, eleven million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •