Search a number
-
+
100120002121301 is a prime number
BaseRepresentation
bin10110110000111100000001…
…001010010100111001010101
3111010111101020002110220122212
4112300330001022110321111
5101110331231020340201
6552534254412403205
730042300662301221
oct2660740112247125
9433441202426585
10100120002121301
11299a0722090038
12b28bb16176505
1343b33778c3a06
141aa1b9654b781
15b8953ea43abb
hex5b0f01294e55

100120002121301 has 2 divisors, whose sum is σ = 100120002121302. Its totient is φ = 100120002121300.

The previous prime is 100120002121193. The next prime is 100120002121309. The reversal of 100120002121301 is 103121200021001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75817961437201 + 24302040684100 = 8707351^2 + 4929710^2 .

It is a cyclic number.

It is not a de Polignac number, because 100120002121301 - 234 = 100102822252117 is a prime.

It is a super-3 number, since 3×1001200021213013 (a number of 43 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2100120002121301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 14.

Adding to 100120002121301 its reverse (103121200021001), we get a palindrome (203241202142302).

The spelling of 100120002121301 in words is "one hundred trillion, one hundred twenty billion, two million, one hundred twenty-one thousand, three hundred one".