Base | Representation |
---|---|
bin | 10011011100110101… |
… | …11110011110100000 |
3 | 222221202101222000021 |
4 | 21232122332132200 |
5 | 132341240000000 |
6 | 4444111003224 |
7 | 516526533262 |
oct | 115632763640 |
9 | 28852358007 |
10 | 10442500000 |
11 | 4479578899 |
12 | 2035209514 |
13 | ca558c4aa |
14 | 710c2bb32 |
15 | 411b6911a |
hex | 26e6be7a0 |
10442500000 has 96 divisors (see below), whose sum is σ = 25704426384. Its totient is φ = 4176000000.
The previous prime is 10442499913. The next prime is 10442500021. The reversal of 10442500000 is 524401.
It can be written as a sum of positive squares in 8 ways, for example, as 7666053136 + 2776446864 = 87556^2 + 52692^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2497912 + ... + 2502088.
Almost surely, 210442500000 is an apocalyptic number.
10442500000 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 10442500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12852213192).
10442500000 is an abundant number, since it is smaller than the sum of its proper divisors (15261926384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10442500000 is an frugal number, since it uses more digits than its factorization.
10442500000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4222 (or 4184 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 16.
The spelling of 10442500000 in words is "ten billion, four hundred forty-two million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •