Base | Representation |
---|---|
bin | 10010110100010000… |
… | …01100011101001000 |
3 | 222002000202101222202 |
4 | 21122020030131020 |
5 | 131142110012300 |
6 | 4350225335332 |
7 | 505223566631 |
oct | 113210143510 |
9 | 28060671882 |
10 | 10102032200 |
11 | 4314374347 |
12 | 1b5b197548 |
13 | c4cb92c60 |
14 | 6bb922888 |
15 | 3e1d14ad5 |
hex | 25a20c748 |
10102032200 has 96 divisors (see below), whose sum is σ = 25671898560. Its totient is φ = 3674246400.
The previous prime is 10102032181. The next prime is 10102032251. The reversal of 10102032200 is 223020101.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145205 + ... + 203195.
It is an arithmetic number, because the mean of its divisors is an integer number (267415610).
Almost surely, 210102032200 is an apocalyptic number.
10102032200 is a gapful number since it is divisible by the number (10) 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 10102032200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12835949280).
10102032200 is an abundant number, since it is smaller than the sum of its proper divisors (15569866360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102032200 is a wasteful number, since it uses less digits than its factorization.
10102032200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58087 (or 58078 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 10102032200 its reverse (223020101), we get a palindrome (10325052301).
The spelling of 10102032200 in words is "ten billion, one hundred two million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •