Base | Representation |
---|---|
bin | 1001101000111111010… |
… | …00101110001000111000 |
3 | 1011122222220121120211010 |
4 | 10310133220232020320 |
5 | 20411341233001412 |
6 | 412100540233520 |
7 | 32634342112416 |
oct | 4643750561070 |
9 | 1148886546733 |
10 | 331243250232 |
11 | 1185301a7664 |
12 | 5424483b8a0 |
13 | 2530b94c21b |
14 | 120647382b6 |
15 | 893a51833c |
hex | 4d1fa2e238 |
331243250232 has 32 divisors (see below), whose sum is σ = 828222266880. Its totient is φ = 110399197920.
The previous prime is 331243250231. The next prime is 331243250251. The reversal of 331243250232 is 232052342133.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 331243250232.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331243250231) 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, 772744 + ... + 1122327.
It is an arithmetic number, because the mean of its divisors is an integer number (25881945840).
Almost surely, 2331243250232 is an apocalyptic number.
It is an amenable number.
331243250232 is an abundant number, since it is smaller than the sum of its proper divisors (496979016648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331243250232 is a wasteful number, since it uses less digits than its factorization.
331243250232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1902363 (or 1902359 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 30.
Adding to 331243250232 its reverse (232052342133), we get a palindrome (563295592365).
The spelling of 331243250232 in words is "three hundred thirty-one billion, two hundred forty-three million, two hundred fifty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.237 sec. • engine limits •