Base | Representation |
---|---|
bin | 101110100101100100110… |
… | …000010001100110100100 |
3 | 102100001110221001221222020 |
4 | 232211210300101212210 |
5 | 404423022344342012 |
6 | 10450415515303140 |
7 | 450203456415456 |
oct | 56454460214644 |
9 | 12301427057866 |
10 | 3201441012132 |
11 | 10247a5a986a0 |
12 | 43856414aab0 |
13 | 1a2b82559c7c |
14 | b0d445242d6 |
15 | 5842445ea8c |
hex | 2e964c119a4 |
3201441012132 has 96 divisors (see below), whose sum is σ = 8504726630400. Its totient is φ = 927812666880.
The previous prime is 3201441012131. The next prime is 3201441012191. The reversal of 3201441012132 is 2312101441023.
It is not an unprimeable number, because it can be changed into a prime (3201441012131) 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, 20759244 + ... + 20912892.
It is an arithmetic number, because the mean of its divisors is an integer number (88590902400).
Almost surely, 23201441012132 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 3201441012132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4252363315200).
3201441012132 is an abundant number, since it is smaller than the sum of its proper divisors (5303285618268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3201441012132 is a wasteful number, since it uses less digits than its factorization.
3201441012132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160553 (or 160551 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 3201441012132 its reverse (2312101441023), we get a palindrome (5513542453155).
The spelling of 3201441012132 in words is "three trillion, two hundred one billion, four hundred forty-one million, twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •