Base | Representation |
---|---|
bin | 10011101101010100… |
… | …10110011101001011 |
3 | 1000022101112200202112 |
4 | 21312222112131023 |
5 | 133132132414412 |
6 | 4505530052535 |
7 | 523125606056 |
oct | 116652263513 |
9 | 30271480675 |
10 | 10580748107 |
11 | 453a613726 |
12 | 207357a14b |
13 | cc81052c7 |
14 | 725337a9d |
15 | 41dd76722 |
hex | 276a9674b |
10580748107 has 32 divisors (see below), whose sum is σ = 11506138560. Its totient is φ = 9709056000.
The previous prime is 10580748041. The next prime is 10580748131. The reversal of 10580748107 is 70184708501.
It is a cyclic number.
It is not a de Polignac number, because 10580748107 - 28 = 10580747851 is a prime.
It is a super-2 number, since 2×105807481072 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10580748187) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 8195132 + ... + 8196422.
It is an arithmetic number, because the mean of its divisors is an integer number (359566830).
Almost surely, 210580748107 is an apocalyptic number.
10580748107 is a deficient number, since it is larger than the sum of its proper divisors (925390453).
10580748107 is a wasteful number, since it uses less digits than its factorization.
10580748107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535.
The product of its (nonzero) digits is 62720, while the sum is 41.
The spelling of 10580748107 in words is "ten billion, five hundred eighty million, seven hundred forty-eight thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •