Base | Representation |
---|---|
bin | 10011001100000110… |
… | …11000111100110011 |
3 | 222120222012212101112 |
4 | 21212003120330303 |
5 | 132044314134001 |
6 | 4422133423535 |
7 | 513203253533 |
oct | 114603307463 |
9 | 28528185345 |
10 | 10302099251 |
11 | 44072a2714 |
12 | 1bb619abab |
13 | c82471922 |
14 | 6da3214c3 |
15 | 404683cbb |
hex | 2660d8f33 |
10302099251 has 2 divisors, whose sum is σ = 10302099252. Its totient is φ = 10302099250.
The previous prime is 10302099221. The next prime is 10302099259. The reversal of 10302099251 is 15299020301.
10302099251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10302099251 is a prime.
It is a super-2 number, since 2×103020992512 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302099259) 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, 5151049625 + 5151049626.
It is an arithmetic number, because the mean of its divisors is an integer number (5151049626).
Almost surely, 210302099251 is an apocalyptic number.
10302099251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302099251 is an equidigital number, since it uses as much as digits as its factorization.
10302099251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 10302099251 in words is "ten billion, three hundred two million, ninety-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •