Search a number
-
+
102283135476737 is a prime number
BaseRepresentation
bin10111010000011010100101…
…111101001110010000000001
3111102011011122120111212020012
4113100122211331032100001
5101401301330140223422
61001312120155354305
730354466306402445
oct2720324575162001
9442134576455205
10102283135476737
112a655041508326
12b57b1a7152995
13450c3485cb067
141b3875cb0c825
15bc59445e54e2
hex5d06a5f4e401

102283135476737 has 2 divisors, whose sum is σ = 102283135476738. Its totient is φ = 102283135476736.

The previous prime is 102283135476727. The next prime is 102283135476803. The reversal of 102283135476737 is 737674531382201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90462906417601 + 11820229059136 = 9511199^2 + 3438056^2 .

It is a cyclic number.

It is not a de Polignac number, because 102283135476737 - 26 = 102283135476673 is a prime.

It is a super-3 number, since 3×1022831354767373 (a number of 43 digits) contains 333 as substring.

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

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

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

Almost surely, 2102283135476737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35562240, while the sum is 59.

The spelling of 102283135476737 in words is "one hundred two trillion, two hundred eighty-three billion, one hundred thirty-five million, four hundred seventy-six thousand, seven hundred thirty-seven".