Base | Representation |
---|---|
bin | 1001011000000000111… |
… | …00100000110010011100 |
3 | 1010210110210110121020020 |
4 | 10230000130200302130 |
5 | 20234210241142112 |
6 | 403552352152140 |
7 | 32162453001504 |
oct | 4540034406234 |
9 | 1123423417206 |
10 | 322130021532 |
11 | 114683aa9aa0 |
12 | 52520838650 |
13 | 244b88a60c7 |
14 | 1183c28aa04 |
15 | 85a542248c |
hex | 4b00720c9c |
322130021532 has 96 divisors (see below), whose sum is σ = 868750686720. Its totient is φ = 91814891520.
The previous prime is 322130021531. The next prime is 322130021537. The reversal of 322130021532 is 235120031223.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (322130021531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3561444 + ... + 3650772.
It is an arithmetic number, because the mean of its divisors is an integer number (9049486320).
Almost surely, 2322130021532 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 322130021532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (434375343360).
322130021532 is an abundant number, since it is smaller than the sum of its proper divisors (546620665188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
322130021532 is a wasteful number, since it uses less digits than its factorization.
322130021532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90971 (or 90969 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 322130021532 its reverse (235120031223), we get a palindrome (557250052755).
The spelling of 322130021532 in words is "three hundred twenty-two billion, one hundred thirty million, twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •