Base | Representation |
---|---|
bin | 11000011001111000… |
… | …01010111110010111 |
3 | 1020211002201122222222 |
4 | 30030330022332113 |
5 | 203313103031241 |
6 | 10004033212555 |
7 | 642452115524 |
oct | 141474127627 |
9 | 36732648888 |
10 | 13102002071 |
11 | 5613814094 |
12 | 2657a0115b |
13 | 130a566862 |
14 | 8c411c14b |
15 | 51a39ea4b |
hex | 30cf0af97 |
13102002071 has 2 divisors, whose sum is σ = 13102002072. Its totient is φ = 13102002070.
The previous prime is 13102001999. The next prime is 13102002077. The reversal of 13102002071 is 17020020131.
It is a strong prime.
It is an emirp because it is prime and its reverse (17020020131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13102002071 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13102002077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551001035 + 6551001036.
It is an arithmetic number, because the mean of its divisors is an integer number (6551001036).
Almost surely, 213102002071 is an apocalyptic number.
13102002071 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102002071 is an equidigital number, since it uses as much as digits as its factorization.
13102002071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
The spelling of 13102002071 in words is "thirteen billion, one hundred two million, two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •