Base | Representation |
---|---|
bin | 110100111001010101010000… |
… | …100011101111110110000000 |
3 | 1010111200222222222210222202110 |
4 | 310321111100203233312000 |
5 | 220443021121303324003 |
6 | 2142440312232215320 |
7 | 100000362555452202 |
oct | 6471252043576600 |
9 | 1114628888728673 |
10 | 232638255136128 |
11 | 6814236a180766 |
12 | 22112a28b3a540 |
13 | 9ca69023182ca |
14 | 4163a7466c772 |
15 | 1bd66c53d3a03 |
hex | d395508efd80 |
232638255136128 has 128 divisors (see below), whose sum is σ = 633027857817600. Its totient is φ = 75653443768320.
The previous prime is 232638255136121. The next prime is 232638255136139. The reversal of 232638255136128 is 821631552836232.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232638255136121) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1545088113 + ... + 1545238671.
It is an arithmetic number, because the mean of its divisors is an integer number (4945530139200).
Almost surely, 2232638255136128 is an apocalyptic number.
It is an amenable number.
232638255136128 is an abundant number, since it is smaller than the sum of its proper divisors (400389602681472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232638255136128 is a wasteful number, since it uses less digits than its factorization.
232638255136128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248760 (or 248748 counting only the distinct ones).
The product of its digits is 24883200, while the sum is 57.
The spelling of 232638255136128 in words is "two hundred thirty-two trillion, six hundred thirty-eight billion, two hundred fifty-five million, one hundred thirty-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.039 sec. • engine limits •