Base | Representation |
---|---|
bin | 10010111111111011… |
… | …11010011001100100 |
3 | 222022212002200200111 |
4 | 21133331322121210 |
5 | 131342200000400 |
6 | 4404045222404 |
7 | 510523366423 |
oct | 113775723144 |
9 | 28285080614 |
10 | 10200000100 |
11 | 43646a8054 |
12 | 1b87b61a04 |
13 | c67274824 |
14 | 6ca9452ba |
15 | 3ea7173ba |
hex | 25ff7a664 |
10200000100 has 36 divisors (see below), whose sum is σ = 22353170868. Its totient is φ = 4039600000.
The previous prime is 10200000077. The next prime is 10200000143. The reversal of 10200000100 is 100000201.
It can be written as a sum of positive squares in 6 ways, for example, as 348643584 + 9851356516 = 18672^2 + 99254^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a self number, because there is not a number n which added to its sum of digits gives 10200000100.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 494851 + ... + 515050.
It is an arithmetic number, because the mean of its divisors is an integer number (620921413).
Almost surely, 210200000100 is an apocalyptic number.
10200000100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200000100 is an abundant number, since it is smaller than the sum of its proper divisors (12153170768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200000100 is a wasteful number, since it uses less digits than its factorization.
10200000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010016 (or 1010009 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
Adding to 10200000100 its reverse (100000201), we get a palindrome (10300000301).
The spelling of 10200000100 in words is "ten billion, two hundred million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •