Base | Representation |
---|---|
bin | 1110100111000111001010… |
… | …10010100000111011010000 |
3 | 11012202121200000222012001021 |
4 | 13103203211102200323100 |
5 | 13202410123231210000 |
6 | 152200224445245224 |
7 | 6524221235412166 |
oct | 723434522407320 |
9 | 135677600865037 |
10 | 32130202210000 |
11 | a268384573374 |
12 | 372b06b863814 |
13 | 14c0b3272731b |
14 | 7d1178101236 |
15 | 3aaba875e11a |
hex | 1d38e54a0ed0 |
32130202210000 has 200 divisors, whose sum is σ = 78828069618144. Its totient is φ = 12681044160000.
The previous prime is 32130202209983. The next prime is 32130202210039. The reversal of 32130202210000 is 1220203123.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 661485715 + ... + 661534285.
Almost surely, 232130202210000 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 32130202210000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39414034809072).
32130202210000 is an abundant number, since it is smaller than the sum of its proper divisors (46697867408144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32130202210000 is an equidigital number, since it uses as much as digits as its factorization.
32130202210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49479 (or 49458 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 32130202210000 its reverse (1220203123), we get a palindrome (32131422413123).
The spelling of 32130202210000 in words is "thirty-two trillion, one hundred thirty billion, two hundred two million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •