Base | Representation |
---|---|
bin | 10011001100000111… |
… | …00000111110010111 |
3 | 222120222021112110212 |
4 | 21212003200332113 |
5 | 132044321211434 |
6 | 4422134240035 |
7 | 513203451416 |
oct | 114603407627 |
9 | 28528245425 |
10 | 10302132119 |
11 | 4407315384 |
12 | 1bb61b601b |
13 | c82483886 |
14 | 6da32d47d |
15 | 40468d8ce |
hex | 2660e0f97 |
10302132119 has 2 divisors, whose sum is σ = 10302132120. Its totient is φ = 10302132118.
The previous prime is 10302132109. The next prime is 10302132121. The reversal of 10302132119 is 91123120301.
10302132119 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 not a de Polignac number, because 10302132119 - 28 = 10302131863 is a prime.
It is a super-2 number, since 2×103021321192 (a number of 21 digits) contains 22 as substring.
Together with 10302132121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10302132094 and 10302132103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10302132109) 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, 5151066059 + 5151066060.
It is an arithmetic number, because the mean of its divisors is an integer number (5151066060).
Almost surely, 210302132119 is an apocalyptic number.
10302132119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302132119 is an equidigital number, since it uses as much as digits as its factorization.
10302132119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 10302132119 in words is "ten billion, three hundred two million, one hundred thirty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •