Base | Representation |
---|---|
bin | 10011001100110001… |
… | …11100010010101101 |
3 | 222121100211220102212 |
4 | 21212120330102231 |
5 | 132102240432122 |
6 | 4422454500205 |
7 | 513302264315 |
oct | 114630742255 |
9 | 28540756385 |
10 | 10307749037 |
11 | 440a501463 |
12 | 1bb8064665 |
13 | c8369c3b1 |
14 | 6dad92445 |
15 | 404decce2 |
hex | 26663c4ad |
10307749037 has 2 divisors, whose sum is σ = 10307749038. Its totient is φ = 10307749036.
The previous prime is 10307749013. The next prime is 10307749079. The reversal of 10307749037 is 73094770301.
It is a happy number.
10307749037 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 can be written as a sum of positive squares in only one way, i.e., 10215953476 + 91795561 = 101074^2 + 9581^2 .
It is a cyclic number.
It is not a de Polignac number, because 10307749037 - 232 = 6012781741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10307748985 and 10307749003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10307749097) 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, 5153874518 + 5153874519.
It is an arithmetic number, because the mean of its divisors is an integer number (5153874519).
Almost surely, 210307749037 is an apocalyptic number.
It is an amenable number.
10307749037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10307749037 is an equidigital number, since it uses as much as digits as its factorization.
10307749037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 111132, while the sum is 41.
The spelling of 10307749037 in words is "ten billion, three hundred seven million, seven hundred forty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •