Base | Representation |
---|---|
bin | 11101111001010011… |
… | …110010000100000000 |
3 | 10001212002210221210220 |
4 | 131321103302010000 |
5 | 1011220100000000 |
6 | 22425130223040 |
7 | 2214316332555 |
oct | 357123620400 |
9 | 101762727726 |
10 | 32100000000 |
11 | 12682682122 |
12 | 627a284a80 |
13 | 3047482c53 |
14 | 17a72d4a2c |
15 | c7d1911a0 |
hex | 7794f2100 |
32100000000 has 324 divisors, whose sum is σ = 107789007312. Its totient is φ = 8480000000.
The previous prime is 32099999993. The next prime is 32100000013. The reversal of 32100000000 is 123.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a nialpdrome in base 10.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 299999947 + ... + 300000053.
Almost surely, 232100000000 is an apocalyptic number.
32100000000 is a gapful number since it is divisible by the number (30) 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 32100000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53894503656).
32100000000 is an abundant number, since it is smaller than the sum of its proper divisors (75689007312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32100000000 is an frugal number, since it uses more digits than its factorization.
32100000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 6.
Adding to 32100000000 its reverse (123), we get a palindrome (32100000123).
The spelling of 32100000000 in words is "thirty-two billion, one hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •