Base | Representation |
---|---|
bin | 100101101001010010111000… |
… | …1101000101110101101111000 |
3 | 1121102102210222201220111020020 |
4 | 1023102211301220232231320 |
5 | 321400222242012402412 |
6 | 3132131251553130440 |
7 | 126514265604453042 |
oct | 11322456150565570 |
9 | 1542383881814206 |
10 | 331131000122232 |
11 | 965659610021a2 |
12 | 3117b4a5b59a20 |
13 | 1129c699c6510b |
14 | 5baab7c474a92 |
15 | 284372591a18c |
hex | 12d2971a2eb78 |
331131000122232 has 32 divisors (see below), whose sum is σ = 827828040307200. Its totient is φ = 110376928040544.
The previous prime is 331131000122227. The next prime is 331131000122233. The reversal of 331131000122232 is 232221000131133.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331131000122233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43513593 + ... + 50553879.
It is an arithmetic number, because the mean of its divisors is an integer number (25869626259600).
Almost surely, 2331131000122232 is an apocalyptic number.
It is an amenable number.
331131000122232 is an abundant number, since it is smaller than the sum of its proper divisors (496697040184968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331131000122232 is a wasteful number, since it uses less digits than its factorization.
331131000122232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9000035 (or 9000031 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 331131000122232 its reverse (232221000131133), we get a palindrome (563352000253365).
The spelling of 331131000122232 in words is "three hundred thirty-one trillion, one hundred thirty-one billion, one hundred twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •