Base | Representation |
---|---|
bin | 10111001100011101011011… |
… | …111101101000101001100000 |
3 | 111101012012000200001101022011 |
4 | 113030131123331220221200 |
5 | 101332323131122144412 |
6 | 1000543203244322304 |
7 | 30326034246523306 |
oct | 2714353375505140 |
9 | 441165020041264 |
10 | 102011311131232 |
11 | 2a55a8327822a8 |
12 | b536585843394 |
13 | 44bc818bcc179 |
14 | 1b29533a02276 |
15 | bbd8357e87a7 |
hex | 5cc75bf68a60 |
102011311131232 has 192 divisors, whose sum is σ = 215808167877120. Its totient is φ = 47327933988864.
The previous prime is 102011311131229. The next prime is 102011311131283. The reversal of 102011311131232 is 232131113110201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2090928343 + ... + 2090977129.
It is an arithmetic number, because the mean of its divisors is an integer number (1124000874360).
Almost surely, 2102011311131232 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 102011311131232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107904083938560).
102011311131232 is an abundant number, since it is smaller than the sum of its proper divisors (113796856745888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011311131232 is a wasteful number, since it uses less digits than its factorization.
102011311131232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49285 (or 49277 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 102011311131232 its reverse (232131113110201), we get a palindrome (334142424241433).
The spelling of 102011311131232 in words is "one hundred two trillion, eleven billion, three hundred eleven million, one hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •