Base | Representation |
---|---|
bin | 10011100010001110… |
… | …01010110001110000 |
3 | 1000001220100021021201 |
4 | 21301013022301300 |
5 | 132434313423102 |
6 | 4452402300544 |
7 | 520615314304 |
oct | 116107126160 |
9 | 30056307251 |
10 | 10487639152 |
11 | 44a1aa9581 |
12 | 2048357754 |
13 | cb1a35253 |
14 | 716c1bd04 |
15 | 415ad3987 |
hex | 2711cac70 |
10487639152 has 60 divisors (see below), whose sum is σ = 21850822440. Its totient is φ = 4873954176.
The previous prime is 10487639143. The next prime is 10487639203. The reversal of 10487639152 is 25193678401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 288999 + ... + 323257.
It is an arithmetic number, because the mean of its divisors is an integer number (364180374).
It is a 1-persistent number, because it is pandigital, but 2⋅10487639152 = 20975278304 is not.
Almost surely, 210487639152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10487639152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10925411220).
10487639152 is an abundant number, since it is smaller than the sum of its proper divisors (11363183288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10487639152 is a wasteful number, since it uses less digits than its factorization.
10487639152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34358 (or 34333 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 10487639152 in words is "ten billion, four hundred eighty-seven million, six hundred thirty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •