Search a number
-
+
10016915707 is a prime number
BaseRepresentation
bin10010101010000111…
…00000000011111011
3221212002121001010001
421111003200003323
5131003312300312
64333545133431
7503141243611
oct112503400373
927762531101
1010016915707
114280319037
121b3678a277
13c38360a76
146b04c76b1
153d9600057
hex2550e00fb

10016915707 has 2 divisors, whose sum is σ = 10016915708. Its totient is φ = 10016915706.

The previous prime is 10016915693. The next prime is 10016915719. The reversal of 10016915707 is 70751961001.

It is a strong prime.

It is an emirp because it is prime and its reverse (70751961001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10016915707 - 223 = 10008527099 is a prime.

It is a super-2 number, since 2×100169157072 (a number of 21 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (10016915737) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5008457853 + 5008457854.

It is an arithmetic number, because the mean of its divisors is an integer number (5008457854).

Almost surely, 210016915707 is an apocalyptic number.

10016915707 is a deficient number, since it is larger than the sum of its proper divisors (1).

10016915707 is an equidigital number, since it uses as much as digits as its factorization.

10016915707 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 13230, while the sum is 37.

The spelling of 10016915707 in words is "ten billion, sixteen million, nine hundred fifteen thousand, seven hundred seven".