Search a number
-
+
10000021511 is a prime number
BaseRepresentation
bin10010101000000110…
…00011100000000111
3221210220210201122002
421110003003200013
5130440001142021
64332143055515
7502544531444
oct112403034007
927726721562
1010000021511
11427182a197
121b30ba159b
13c349c71bc
146ac16a9cb
153d7db450b
hex2540c3807

10000021511 has 2 divisors, whose sum is σ = 10000021512. Its totient is φ = 10000021510.

The previous prime is 10000021459. The next prime is 10000021517. The reversal of 10000021511 is 11512000001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10000021511 - 210 = 10000020487 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10000021492 and 10000021501.

It is a congruent number.

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

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

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

Almost surely, 210000021511 is an apocalyptic number.

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

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

10000021511 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 10, while the sum is 11.

Adding to 10000021511 its reverse (11512000001), we get a palindrome (21512021512).

The spelling of 10000021511 in words is "ten billion, twenty-one thousand, five hundred eleven".