Search a number
-
+
30103220100931 is a prime number
BaseRepresentation
bin1101101100000111100111…
…01111011001111101000011
310221120211200011112011210021
412312003303233121331003
512421202343321212211
6144005121200114311
76224612566644115
oct666036357317503
9127524604464707
1030103220100931
119656781a5969a
123462257605997
1313a494c107853
14761009d493b5
153730c1a82771
hex1b60f3bd9f43

30103220100931 has 2 divisors, whose sum is σ = 30103220100932. Its totient is φ = 30103220100930.

The previous prime is 30103220100883. The next prime is 30103220100959. The reversal of 30103220100931 is 13900102230103.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 30103220100931 - 223 = 30103211712323 is a prime.

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

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

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

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

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

Almost surely, 230103220100931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 25.

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