Search a number
-
+
10001012122097 is a prime number
BaseRepresentation
bin1001000110001000101011…
…0001100110000111110001
31022102002100201201101022222
42101202022301212013301
52302324033100401342
633134222422210425
72051356255263503
oct221421261460761
938362321641288
1010001012122097
113206450687367
12115631a883a15
13577125a4b139
142680a1713d73
15125238c1aed2
hex9188ac661f1

10001012122097 has 2 divisors, whose sum is σ = 10001012122098. Its totient is φ = 10001012122096.

The previous prime is 10001012122093. The next prime is 10001012122111. The reversal of 10001012122097 is 79022121010001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9445486369201 + 555525752896 = 3073351^2 + 745336^2 .

It is a cyclic number.

It is not a de Polignac number, because 10001012122097 - 22 = 10001012122093 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10001012122093) 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, 5000506061048 + 5000506061049.

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

Almost surely, 210001012122097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 26.

Adding to 10001012122097 its reverse (79022121010001), we get a palindrome (89023133132098).

The spelling of 10001012122097 in words is "ten trillion, one billion, twelve million, one hundred twenty-two thousand, ninety-seven".