Base | Representation |
---|---|
bin | 10011000110000011… |
… | …01010110001111101 |
3 | 222110102122211100022 |
4 | 21203001222301331 |
5 | 131443314110344 |
6 | 4413121141525 |
7 | 512015515451 |
oct | 114301526175 |
9 | 28412584308 |
10 | 10251316349 |
11 | 439066777a |
12 | 1ba118a8a5 |
13 | c74aa1081 |
14 | 6d36a2661 |
15 | 3eeea20ee |
hex | 26306ac7d |
10251316349 has 2 divisors, whose sum is σ = 10251316350. Its totient is φ = 10251316348.
The previous prime is 10251316333. The next prime is 10251316379. The reversal of 10251316349 is 94361315201.
10251316349 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., 7577702500 + 2673613849 = 87050^2 + 51707^2 .
It is an emirp because it is prime and its reverse (94361315201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10251316349 - 24 = 10251316333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10251316379) 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, 5125658174 + 5125658175.
It is an arithmetic number, because the mean of its divisors is an integer number (5125658175).
Almost surely, 210251316349 is an apocalyptic number.
It is an amenable number.
10251316349 is a deficient number, since it is larger than the sum of its proper divisors (1).
10251316349 is an equidigital number, since it uses as much as digits as its factorization.
10251316349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The spelling of 10251316349 in words is "ten billion, two hundred fifty-one million, three hundred sixteen thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •