Base | Representation |
---|---|
bin | 10010110101001001… |
… | …00111000000000000 |
3 | 222002112202211202202 |
4 | 21122210213000000 |
5 | 131201011342320 |
6 | 4351053132332 |
7 | 505344112265 |
oct | 113244470000 |
9 | 28075684682 |
10 | 10109480960 |
11 | 43185a1747 |
12 | 1b6178a0a8 |
13 | c515a04c7 |
14 | 6bc90126c |
15 | 3e27d6b75 |
hex | 25a927000 |
10109480960 has 52 divisors (see below), whose sum is σ = 24259841688. Its totient is φ = 4043784192.
The previous prime is 10109480957. The next prime is 10109480963. The reversal of 10109480960 is 6908490101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10109480957) and next prime (10109480963).
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10109480963) 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 3 ways as a sum of consecutive naturals, for example, 226334 + ... + 267293.
Almost surely, 210109480960 is an apocalyptic number.
10109480960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10109480960 is an abundant number, since it is smaller than the sum of its proper divisors (14150360728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10109480960 is an frugal number, since it uses more digits than its factorization.
10109480960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493656 (or 493634 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 38.
The spelling of 10109480960 in words is "ten billion, one hundred nine million, four hundred eighty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •