Search a number
-
+
20130132029963 is a prime number
BaseRepresentation
bin1001001001110111010010…
…10111100111001000001011
32122021102101111211120100012
410210323221113213020023
510114303002244424323
6110451353251102135
74145232303023144
oct444735127471013
978242344746305
1020130132029963
11646116081523a
1223114305a194b
13b30356634cb7
144d8437094acb
1524d96e5c9678
hex124ee95e720b

20130132029963 has 2 divisors, whose sum is σ = 20130132029964. Its totient is φ = 20130132029962.

The previous prime is 20130132029827. The next prime is 20130132029977. The reversal of 20130132029963 is 36992023103102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20130132029963 - 216 = 20130131964427 is a prime.

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

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

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

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

Almost surely, 220130132029963 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 104976, while the sum is 41.

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