Base | Representation |
---|---|
bin | 1001101000110011011… |
… | …11110000111010100000 |
3 | 1011122202000200011111012 |
4 | 10310121233300322200 |
5 | 20411140433331222 |
6 | 412043050240052 |
7 | 32632032145430 |
oct | 4643157607240 |
9 | 1148660604435 |
10 | 331144433312 |
11 | 11848a443a90 |
12 | 54217726028 |
13 | 252c4331084 |
14 | 120555742c0 |
15 | 89319e91e2 |
hex | 4d19bf0ea0 |
331144433312 has 48 divisors (see below), whose sum is σ = 812809069632. Its totient is φ = 129017310720.
The previous prime is 331144433309. The next prime is 331144433447. The reversal of 331144433312 is 213334441133.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
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, 67194053 + ... + 67198980.
It is an arithmetic number, because the mean of its divisors is an integer number (16933522284).
Almost surely, 2331144433312 is an apocalyptic number.
331144433312 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
331144433312 is an abundant number, since it is smaller than the sum of its proper divisors (481664636320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331144433312 is a wasteful number, since it uses less digits than its factorization.
331144433312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134393061 (or 134393053 counting only the distinct ones).
The product of its digits is 31104, while the sum is 32.
Adding to 331144433312 its reverse (213334441133), we get a palindrome (544478874445).
The spelling of 331144433312 in words is "three hundred thirty-one billion, one hundred forty-four million, four hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •