Base | Representation |
---|---|
bin | 1001101001100011110… |
… | …11101101111111001000 |
3 | 1011200210022020021111101 |
4 | 10310301323231333020 |
5 | 20413003324021412 |
6 | 412151223511144 |
7 | 32645060241610 |
oct | 4646173557710 |
9 | 1150708207441 |
10 | 331550220232 |
11 | 118678501780 |
12 | 5430b5b84b4 |
13 | 2535a41a68a |
14 | 12093403a40 |
15 | 8957452457 |
hex | 4d31eedfc8 |
331550220232 has 64 divisors (see below), whose sum is σ = 787758330240. Its totient is φ = 127057766400.
The previous prime is 331550220203. The next prime is 331550220257. The reversal of 331550220232 is 232022055133.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 331550220232.
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 15 ways as a sum of consecutive naturals, for example, 4374153 + ... + 4449304.
It is an arithmetic number, because the mean of its divisors is an integer number (12308723910).
Almost surely, 2331550220232 is an apocalyptic number.
It is an amenable number.
331550220232 is an abundant number, since it is smaller than the sum of its proper divisors (456208110008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331550220232 is a wasteful number, since it uses less digits than its factorization.
331550220232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8823542 (or 8823538 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 331550220232 its reverse (232022055133), we get a palindrome (563572275365).
The spelling of 331550220232 in words is "three hundred thirty-one billion, five hundred fifty million, two hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •