Search a number
-
+
101410072126513 = 277172936587297
BaseRepresentation
bin10111000011101101011111…
…010100110110010000110001
3111022001201010021210100212021
4113003231133110312100301
5101243000311431022023
6555403051034031441
730234431060355523
oct2703553724662061
9438051107710767
10101410072126513
112a348851a62167
12b459b4bb78581
134477c0c671997
141b083b8d97a13
15bacd96cd835d
hex5c3b5f536431

101410072126513 has 4 divisors (see below), whose sum is σ = 101410111485540. Its totient is φ = 101410032767488.

The previous prime is 101410072126481. The next prime is 101410072126567. The reversal of 101410072126513 is 315621270014101.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 61205697087649 + 40204375038864 = 7823407^2 + 6340692^2 .

It is a cyclic number.

It is not a de Polignac number, because 101410072126513 - 25 = 101410072126481 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (101410072526513) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15521920 + ... + 21065377.

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

Almost surely, 2101410072126513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 39359026.

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

The spelling of 101410072126513 in words is "one hundred one trillion, four hundred ten billion, seventy-two million, one hundred twenty-six thousand, five hundred thirteen".

Divisors: 1 2771729 36587297 101410072126513