Search a number
-
+
1060060506023 is a prime number
BaseRepresentation
bin11110110110100001000…
…01111010011110100111
310202100012102212020220002
433123100201322132213
5114332000442143043
62130552435331515
7136405200426101
oct17332041723647
93670172766802
101060060506023
1137962957a032
12151544150b9b
1378c6a41c0bc
1439442d6a571
151c89446bbb8
hexf6d087a7a7

1060060506023 has 2 divisors, whose sum is σ = 1060060506024. Its totient is φ = 1060060506022.

The previous prime is 1060060505947. The next prime is 1060060506049. The reversal of 1060060506023 is 3206050600601.

It is a strong prime.

It is an emirp because it is prime and its reverse (3206050600601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1060060506023 - 226 = 1059993397159 is a prime.

It is a super-3 number, since 3×10600605060233 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Sophie Germain prime.

It is a congruent number.

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

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

Almost surely, 21060060506023 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 29.

The spelling of 1060060506023 in words is "one trillion, sixty billion, sixty million, five hundred six thousand, twenty-three".