Search a number
-
+
10061050069051 is a prime number
BaseRepresentation
bin1001001001101000010101…
…0100001100000000111011
31022121211022212201002111221
42102122011110030000323
52304320012304202201
633221552123532511
72055613125355642
oct222320524140073
938554285632457
1010061050069051
11322995a522543
121165a9538a137
1357c9a3303537
1426ad59244359
15126a9e9674a1
hex9268550c03b

10061050069051 has 2 divisors, whose sum is σ = 10061050069052. Its totient is φ = 10061050069050.

The previous prime is 10061050069043. The next prime is 10061050069061. The reversal of 10061050069051 is 15096005016001.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10061050069051 - 23 = 10061050069043 is a prime.

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

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

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

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

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

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

Almost surely, 210061050069051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 34.

The spelling of 10061050069051 in words is "ten trillion, sixty-one billion, fifty million, sixty-nine thousand, fifty-one".