Base | Representation |
---|---|
bin | 10010110000110101… |
… | …11100110100000111 |
3 | 222000000212110100221 |
4 | 21120122330310013 |
5 | 131112242110224 |
6 | 4343323445211 |
7 | 504425303623 |
oct | 113032746407 |
9 | 28000773327 |
10 | 10073394439 |
11 | 42aa194379 |
12 | 1b51686807 |
13 | c46c77034 |
14 | 6b7bca183 |
15 | 3de5596e4 |
hex | 2586bcd07 |
10073394439 has 2 divisors, whose sum is σ = 10073394440. Its totient is φ = 10073394438.
The previous prime is 10073394437. The next prime is 10073394469. The reversal of 10073394439 is 93449337001.
10073394439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10073394439 - 21 = 10073394437 is a prime.
It is a super-2 number, since 2×100733944392 (a number of 21 digits) contains 22 as substring.
Together with 10073394437, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10073394395 and 10073394404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10073394437) 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 as a sum of consecutive naturals, namely, 5036697219 + 5036697220.
It is an arithmetic number, because the mean of its divisors is an integer number (5036697220).
Almost surely, 210073394439 is an apocalyptic number.
10073394439 is a deficient number, since it is larger than the sum of its proper divisors (1).
10073394439 is an equidigital number, since it uses as much as digits as its factorization.
10073394439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 244944, while the sum is 43.
The spelling of 10073394439 in words is "ten billion, seventy-three million, three hundred ninety-four thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •