Base | Representation |
---|---|
bin | 10011011010101011… |
… | …10010110010101000 |
3 | 222220111021120100222 |
4 | 21231111302302220 |
5 | 132322114123300 |
6 | 4442222145212 |
7 | 516216430235 |
oct | 115525626250 |
9 | 28814246328 |
10 | 10424364200 |
11 | 446a311128 |
12 | 202b122208 |
13 | ca18ac753 |
14 | 70c66a78c |
15 | 410285785 |
hex | 26d572ca8 |
10424364200 has 24 divisors (see below), whose sum is σ = 24236647230. Its totient is φ = 4169745600.
The previous prime is 10424364199. The next prime is 10424364211. The reversal of 10424364200 is 246342401.
10424364200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 4775639236 + 5648724964 = 69106^2 + 75158^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10424364200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26060711 + ... + 26061110.
Almost surely, 210424364200 is an apocalyptic number.
10424364200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10424364200 is an abundant number, since it is smaller than the sum of its proper divisors (13812283030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10424364200 is a wasteful number, since it uses less digits than its factorization.
10424364200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52121837 (or 52121828 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
The spelling of 10424364200 in words is "ten billion, four hundred twenty-four million, three hundred sixty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •