Search a number
-
+
5106126075451 = 9295496368219
BaseRepresentation
bin100101001001101110011…
…0101001011011000111011
3200002010210201001100100021
41022103130311023120323
51132124321233403301
614505415534351311
71034622364343002
oct112233465133073
920063721040307
105106126075451
111699550064835
126a572735b537
132b0675b12b0b
141391d0273c39
158cc4e6998a1
hex4a4dcd4b63b

5106126075451 has 4 divisors (see below), whose sum is σ = 5111622444600. Its totient is φ = 5100629706304.

The previous prime is 5106126075431. The next prime is 5106126075461. The reversal of 5106126075451 is 1545706216015.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 5106126075451 - 223 = 5106117686843 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (5106126075431) 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 in 3 ways as a sum of consecutive naturals, for example, 2748183181 + ... + 2748185038.

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

Almost surely, 25106126075451 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5496369148.

The product of its (nonzero) digits is 252000, while the sum is 43.

The spelling of 5106126075451 in words is "five trillion, one hundred six billion, one hundred twenty-six million, seventy-five thousand, four hundred fifty-one".

Divisors: 1 929 5496368219 5106126075451