Base | Representation |
---|---|
bin | 1001110101011011… |
… | …11001000100010011 |
3 | 111121222101122200021 |
4 | 10322231321010103 |
5 | 41303144413201 |
6 | 2231534204311 |
7 | 244562622505 |
oct | 47255710423 |
9 | 14558348607 |
10 | 5280076051 |
11 | 226a513318 |
12 | 1034353697 |
13 | 661ba1a73 |
14 | 381369d75 |
15 | 20d82bea1 |
hex | 13ab79113 |
5280076051 has 8 divisors (see below), whose sum is σ = 5328135504. Its totient is φ = 5232230400.
The previous prime is 5280076031. The next prime is 5280076073. The reversal of 5280076051 is 1506700825.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5280076051 - 27 = 5280075923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5280075998 and 5280076016.
It is not an unprimeable number, because it can be changed into a prime (5280076031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3625 + ... + 102826.
It is an arithmetic number, because the mean of its divisors is an integer number (666016938).
Almost surely, 25280076051 is an apocalyptic number.
5280076051 is a deficient number, since it is larger than the sum of its proper divisors (48059453).
5280076051 is a wasteful number, since it uses less digits than its factorization.
5280076051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106901.
The product of its (nonzero) digits is 16800, while the sum is 34.
The square root of 5280076051 is about 72664.1318051761. The cubic root of 5280076051 is about 1741.3258986075.
Adding to 5280076051 its reverse (1506700825), we get a palindrome (6786776876).
The spelling of 5280076051 in words is "five billion, two hundred eighty million, seventy-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •