Base | Representation |
---|---|
bin | 100110011011… |
… | …010101010101 |
3 | 200221210010222 |
4 | 212123111111 |
5 | 10034322204 |
6 | 555524125 |
7 | 151423412 |
oct | 46332525 |
9 | 20853128 |
10 | 10073429 |
11 | 5760353 |
12 | 3459645 |
13 | 2119112 |
14 | 14a3109 |
15 | d3eabe |
hex | 99b555 |
10073429 has 4 divisors (see below), whose sum is σ = 10090476. Its totient is φ = 10056384.
The previous prime is 10073407. The next prime is 10073447. The reversal of 10073429 is 92437001.
10073429 is nontrivially palindromic in base 13.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4774225 + 5299204 = 2185^2 + 2302^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10073429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10073398 and 10073407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10073449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7604 + ... + 8829.
It is an arithmetic number, because the mean of its divisors is an integer number (2522619).
Almost surely, 210073429 is an apocalyptic number.
It is an amenable number.
10073429 is a deficient number, since it is larger than the sum of its proper divisors (17047).
10073429 is an equidigital number, since it uses as much as digits as its factorization.
10073429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17046.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 10073429 is about 3173.8665693441. The cubic root of 10073429 is about 215.9695101568.
The spelling of 10073429 in words is "ten million, seventy-three thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •