Search a number
-
+
10133123303123 is a prime number
BaseRepresentation
bin1001001101110100110100…
…1101110000011011010011
31022212201100210012201212122
42103131031031300123103
52312010114031144443
633315031555244455
72064044145633542
oct223351515603323
938781323181778
1010133123303123
113257484a30aa7
121177a4a5a972b
1358671b126ac2
1427063533a159
151288bc0a4968
hex9374d3706d3

10133123303123 has 2 divisors, whose sum is σ = 10133123303124. Its totient is φ = 10133123303122.

The previous prime is 10133123303119. The next prime is 10133123303141. The reversal of 10133123303123 is 32130332133101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10133123303123 - 22 = 10133123303119 is a prime.

It is a super-4 number, since 4×101331233031234 (a number of 53 digits) contains 4444 as substring.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210133123303123 is an apocalyptic number.

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

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

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

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

Adding to 10133123303123 its reverse (32130332133101), we get a palindrome (42263455436224).

The spelling of 10133123303123 in words is "ten trillion, one hundred thirty-three billion, one hundred twenty-three million, three hundred three thousand, one hundred twenty-three".