Search a number
-
+
103013101012099 is a prime number
BaseRepresentation
bin10111011011000010011011…
…010010110000010010000011
3111111201221211010110011202011
4113123002123102300102003
5102000231312324341344
61003031322034233351
730461310450153025
oct2733023322602203
9444657733404664
10103013101012099
112a906679a80183
12b678767125857
13456312ac53bc5
141b61c09a4a015
15bd9919269d34
hex5db09b4b0483

103013101012099 has 2 divisors, whose sum is σ = 103013101012100. Its totient is φ = 103013101012098.

The previous prime is 103013101012097. The next prime is 103013101012183. The reversal of 103013101012099 is 990210101310301.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 103013101012099 - 21 = 103013101012097 is a prime.

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

Together with 103013101012097, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 103013101012099.

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

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

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

Almost surely, 2103013101012099 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 31.

The spelling of 103013101012099 in words is "one hundred three trillion, thirteen billion, one hundred one million, twelve thousand, ninety-nine".