Search a number
-
+
10653512056501 is a prime number
BaseRepresentation
bin1001101100000111011011…
…0011010011111010110101
31101201110120120110102202011
42123001312303103322311
52344021343041302001
634354053400244221
72146455650230666
oct233016663237265
941643516412664
1010653512056501
1134381469016a6
12124087b770671
135c3811353992
1428b8c031d36d
151371c7b44d51
hex9b076cd3eb5

10653512056501 has 2 divisors, whose sum is σ = 10653512056502. Its totient is φ = 10653512056500.

The previous prime is 10653512056417. The next prime is 10653512056507. The reversal of 10653512056501 is 10565021535601.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10653500160900 + 11895601 = 3263970^2 + 3449^2 .

It is a cyclic number.

It is not a de Polignac number, because 10653512056501 - 217 = 10653511925429 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210653512056501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 10653512056501 in words is "ten trillion, six hundred fifty-three billion, five hundred twelve million, fifty-six thousand, five hundred one".