Base | Representation |
---|---|
bin | 10010101101000001… |
… | …10011110100100111 |
3 | 221220210121202101021 |
4 | 21112200303310213 |
5 | 131031043013124 |
6 | 4340221312011 |
7 | 503556200542 |
oct | 112640636447 |
9 | 27823552337 |
10 | 10041376039 |
11 | 4293105492 |
12 | 1b42a05607 |
13 | c40446436 |
14 | 6b3853859 |
15 | 3db8327e4 |
hex | 256833d27 |
10041376039 has 8 divisors (see below), whose sum is σ = 10276673792. Its totient is φ = 9806159160.
The previous prime is 10041376027. The next prime is 10041376061. The reversal of 10041376039 is 93067314001.
10041376039 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10041376039 - 29 = 10041375527 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10041375995 and 10041376013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041376069) 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 7 ways as a sum of consecutive naturals, for example, 283912 + ... + 317314.
It is an arithmetic number, because the mean of its divisors is an integer number (1284584224).
Almost surely, 210041376039 is an apocalyptic number.
10041376039 is a deficient number, since it is larger than the sum of its proper divisors (235297753).
10041376039 is an equidigital number, since it uses as much as digits as its factorization.
10041376039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40437.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 10041376039 in words is "ten billion, forty-one million, three hundred seventy-six thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •