Base | Representation |
---|---|
bin | 1001011101001010… |
… | …11100011111110001 |
3 | 111002210101201020020 |
4 | 10232211130133301 |
5 | 40344043112111 |
6 | 2155423434053 |
7 | 236541560256 |
oct | 45645343761 |
9 | 14083351206 |
10 | 5076535281 |
11 | 2175632104 |
12 | b98155929 |
13 | 62b977c3c |
14 | 36230542d |
15 | 1eaa23906 |
hex | 12e95c7f1 |
5076535281 has 4 divisors (see below), whose sum is σ = 6768713712. Its totient is φ = 3384356852.
The previous prime is 5076535271. The next prime is 5076535297. The reversal of 5076535281 is 1825356705.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5076535281 - 210 = 5076534257 is a prime.
It is a super-2 number, since 2×50765352812 = 51542420918475497922, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5076535271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 846089211 + ... + 846089216.
It is an arithmetic number, because the mean of its divisors is an integer number (1692178428).
Almost surely, 25076535281 is an apocalyptic number.
It is an amenable number.
5076535281 is a deficient number, since it is larger than the sum of its proper divisors (1692178431).
5076535281 is a wasteful number, since it uses less digits than its factorization.
5076535281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1692178430.
The product of its (nonzero) digits is 252000, while the sum is 42.
The square root of 5076535281 is about 71249.8089892176. The cubic root of 5076535281 is about 1718.6567032271.
The spelling of 5076535281 in words is "five billion, seventy-six million, five hundred thirty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •