Base | Representation |
---|---|
bin | 10010110111010000… |
… | …01110101100100000 |
3 | 222010210010102121011 |
4 | 21123220032230200 |
5 | 131220031112300 |
6 | 4352525110304 |
7 | 505650561265 |
oct | 113350165440 |
9 | 28123112534 |
10 | 10127207200 |
11 | 43275a9730 |
12 | 1b676b8394 |
13 | c551689c6 |
14 | 6c0dd726c |
15 | 3e4138eba |
hex | 25ba0eb20 |
10127207200 has 144 divisors (see below), whose sum is σ = 27234881856. Its totient is φ = 3646540800.
The previous prime is 10127207197. The next prime is 10127207227. The reversal of 10127207200 is 270272101.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 900814 + ... + 911986.
It is an arithmetic number, because the mean of its divisors is an integer number (189131124).
Almost surely, 210127207200 is an apocalyptic number.
10127207200 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 10127207200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13617440928).
10127207200 is an abundant number, since it is smaller than the sum of its proper divisors (17107674656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10127207200 is a wasteful number, since it uses less digits than its factorization.
10127207200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11307 (or 11294 counting only the distinct ones).
The product of its (nonzero) digits is 392, while the sum is 22.
Adding to 10127207200 its reverse (270272101), we get a palindrome (10397479301).
The spelling of 10127207200 in words is "ten billion, one hundred twenty-seven million, two hundred seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •