Base | Representation |
---|---|
bin | 10010110001101010… |
… | …00110011011010101 |
3 | 222000111202201211012 |
4 | 21120311012123111 |
5 | 131121020441212 |
6 | 4344130422005 |
7 | 504540464450 |
oct | 113065063325 |
9 | 28014681735 |
10 | 10080249557 |
11 | 4303046764 |
12 | 1b53a31905 |
13 | c48507311 |
14 | 6b8a92497 |
15 | 3dee60922 |
hex | 258d466d5 |
10080249557 has 8 divisors (see below), whose sum is σ = 11521444800. Its totient is φ = 8639344224.
The previous prime is 10080249539. The next prime is 10080249589. The reversal of 10080249557 is 75594208001.
10080249557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10080249557 - 218 = 10079987413 is a prime.
It is a super-2 number, since 2×100802495572 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10080219557) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 7994 + ... + 142212.
It is an arithmetic number, because the mean of its divisors is an integer number (1440180600).
Almost surely, 210080249557 is an apocalyptic number.
It is an amenable number.
10080249557 is a deficient number, since it is larger than the sum of its proper divisors (1441195243).
10080249557 is a wasteful number, since it uses less digits than its factorization.
10080249557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144955.
The product of its (nonzero) digits is 100800, while the sum is 41.
The spelling of 10080249557 in words is "ten billion, eighty million, two hundred forty-nine thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •