Search a number
-
+
10055525261051 is a prime number
BaseRepresentation
bin1001001001010011110000…
…0000101101111011111011
31022121022001211210202201102
42102110330000231323323
52304222203431323201
633215240004042015
72055326201311664
oct222247400557373
938538054722642
1010055525261051
113227584954516
1211649b309330b
1357c302814b8a
1426a9935b036b
151268798e726b
hex9253c02defb

10055525261051 has 2 divisors, whose sum is σ = 10055525261052. Its totient is φ = 10055525261050.

The previous prime is 10055525261029. The next prime is 10055525261113. The reversal of 10055525261051 is 15016252555001.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10055525261051 - 26 = 10055525260987 is a prime.

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

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

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

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

Almost surely, 210055525261051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 75000, while the sum is 38.

The spelling of 10055525261051 in words is "ten trillion, fifty-five billion, five hundred twenty-five million, two hundred sixty-one thousand, fifty-one".