Base | Representation |
---|---|
bin | 10011000010011100… |
… | …00001011000001000 |
3 | 222101022121121101222 |
4 | 21201032001120020 |
5 | 131413034001300 |
6 | 4410115301212 |
7 | 511200032255 |
oct | 114116013010 |
9 | 28338547358 |
10 | 10221000200 |
11 | 4375540804 |
12 | 1b92baa808 |
13 | c6b718218 |
14 | 6cd65042c |
15 | 3ec4b4785 |
hex | 261381608 |
10221000200 has 24 divisors (see below), whose sum is σ = 23763825930. Its totient is φ = 4088400000.
The previous prime is 10221000161. The next prime is 10221000203. The reversal of 10221000200 is 200012201.
It can be written as a sum of positive squares in 3 ways, for example, as 8564021764 + 1656978436 = 92542^2 + 40706^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (10221000203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 25552301 + ... + 25552700.
Almost surely, 210221000200 is an apocalyptic number.
10221000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221000200 is an abundant number, since it is smaller than the sum of its proper divisors (13542825730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221000200 is a wasteful number, since it uses less digits than its factorization.
10221000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51105017 (or 51105008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 10221000200 its reverse (200012201), we get a palindrome (10421012401).
The spelling of 10221000200 in words is "ten billion, two hundred twenty-one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •