Base | Representation |
---|---|
bin | 10011100010001010… |
… | …11101010001101110 |
3 | 1000001212111111001002 |
4 | 21301011131101232 |
5 | 132434210100023 |
6 | 4452344520302 |
7 | 520611435551 |
oct | 116105352156 |
9 | 30055444032 |
10 | 10487190638 |
11 | 44a1822601 |
12 | 2048180092 |
13 | cb1909062 |
14 | 716b42698 |
15 | 415a45b28 |
hex | 27115d46e |
10487190638 has 32 divisors (see below), whose sum is σ = 16891969440. Its totient is φ = 4868242560.
The previous prime is 10487190563. The next prime is 10487190647. The reversal of 10487190638 is 83609178401.
10487190638 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10487190592 and 10487190601.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 633920 + ... + 650252.
It is an arithmetic number, because the mean of its divisors is an integer number (527874045).
Almost surely, 210487190638 is an apocalyptic number.
10487190638 is a deficient number, since it is larger than the sum of its proper divisors (6404778802).
10487190638 is a wasteful number, since it uses less digits than its factorization.
10487190638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16692.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 10487190638 in words is "ten billion, four hundred eighty-seven million, one hundred ninety thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •