Base | Representation |
---|---|
bin | 1001011000000000111… |
… | …01101100001000000000 |
3 | 1010210110211001021112010 |
4 | 10230000131230020000 |
5 | 20234210331030422 |
6 | 403552402532520 |
7 | 32162455425243 |
oct | 4540035541000 |
9 | 1123424037463 |
10 | 322130330112 |
11 | 11468419a918 |
12 | 52520967140 |
13 | 244b89836b6 |
14 | 1183c32b25a |
15 | 85a5483b0c |
hex | 4b0076c200 |
322130330112 has 80 divisors (see below), whose sum is σ = 860088477600. Its totient is φ = 107137400832.
The previous prime is 322130330089. The next prime is 322130330129. The reversal of 322130330112 is 211033031223.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 456123 + ... + 923205.
It is an arithmetic number, because the mean of its divisors is an integer number (10751105970).
Almost surely, 2322130330112 is an apocalyptic number.
322130330112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 322130330112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (430044238800).
322130330112 is an abundant number, since it is smaller than the sum of its proper divisors (537958147488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
322130330112 is an equidigital number, since it uses as much as digits as its factorization.
322130330112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467553 (or 467537 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 322130330112 its reverse (211033031223), we get a palindrome (533163361335).
The spelling of 322130330112 in words is "three hundred twenty-two billion, one hundred thirty million, three hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •