Base | Representation |
---|---|
bin | 10011010110100110… |
… | …00110110101000101 |
3 | 222211002211001011000 |
4 | 21223103012311011 |
5 | 132234331333123 |
6 | 4435000003513 |
7 | 515322303342 |
oct | 115323066505 |
9 | 28732731130 |
10 | 10390105413 |
11 | 4451a41a86 |
12 | 201b760599 |
13 | c9777618c |
14 | 707cad7c9 |
15 | 40c269b43 |
hex | 26b4c6d45 |
10390105413 has 32 divisors (see below), whose sum is σ = 15950246400. Its totient is φ = 6676665408.
The previous prime is 10390105409. The next prime is 10390105447. The reversal of 10390105413 is 31450109301.
10390105413 is a `hidden beast` number, since 103 + 9 + 0 + 10 + 541 + 3 = 666.
10390105413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10390105413 - 22 = 10390105409 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10390105613) 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 31 ways as a sum of consecutive naturals, for example, 469156 + ... + 490802.
It is an arithmetic number, because the mean of its divisors is an integer number (498445200).
Almost surely, 210390105413 is an apocalyptic number.
It is an amenable number.
10390105413 is a deficient number, since it is larger than the sum of its proper divisors (5560140987).
10390105413 is a wasteful number, since it uses less digits than its factorization.
10390105413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22298 (or 22292 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The spelling of 10390105413 in words is "ten billion, three hundred ninety million, one hundred five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •