Base | Representation |
---|---|
bin | 10010110011100110… |
… | …01001100101101111 |
3 | 222001122101010102021 |
4 | 21121303021211233 |
5 | 131134201443224 |
6 | 4345511211011 |
7 | 505125652033 |
oct | 113163114557 |
9 | 28048333367 |
10 | 10096515439 |
11 | 431124653a |
12 | 1b59376a67 |
13 | c4b9b0bba |
14 | 6bacc81c3 |
15 | 3e15c51e4 |
hex | 259cc996f |
10096515439 has 4 divisors (see below), whose sum is σ = 10132192456. Its totient is φ = 10060838424.
The previous prime is 10096515433. The next prime is 10096515449. The reversal of 10096515439 is 93451569001.
10096515439 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10096515439 - 29 = 10096514927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10096515395 and 10096515404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10096515433) 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 3 ways as a sum of consecutive naturals, for example, 17838084 + ... + 17838649.
It is an arithmetic number, because the mean of its divisors is an integer number (2533048114).
Almost surely, 210096515439 is an apocalyptic number.
10096515439 is a deficient number, since it is larger than the sum of its proper divisors (35677017).
10096515439 is an equidigital number, since it uses as much as digits as its factorization.
10096515439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35677016.
The product of its (nonzero) digits is 145800, while the sum is 43.
The spelling of 10096515439 in words is "ten billion, ninety-six million, five hundred fifteen thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •