Base | Representation |
---|---|
bin | 1001110011111000… |
… | …11111100111101111 |
3 | 111121002000202121011 |
4 | 10321330133213233 |
5 | 41241341024032 |
6 | 2230352450051 |
7 | 244344560500 |
oct | 47174374757 |
9 | 14532022534 |
10 | 5267126767 |
11 | 2263179331 |
12 | 102bb49927 |
13 | 65c2b9976 |
14 | 37d758ba7 |
15 | 20c620247 |
hex | 139f1f9ef |
5267126767 has 12 divisors (see below), whose sum is σ = 6144443136. Its totient is φ = 4501875840.
The previous prime is 5267126747. The next prime is 5267126771. The reversal of 5267126767 is 7676217625.
It is a de Polignac number, because none of the positive numbers 2k-5267126767 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5267126767.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5267126737) 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 11 ways as a sum of consecutive naturals, for example, 134959 + ... + 169552.
It is an arithmetic number, because the mean of its divisors is an integer number (512036928).
Almost surely, 25267126767 is an apocalyptic number.
5267126767 is a deficient number, since it is larger than the sum of its proper divisors (877316369).
5267126767 is a wasteful number, since it uses less digits than its factorization.
5267126767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304878 (or 304871 counting only the distinct ones).
The product of its digits is 1481760, while the sum is 49.
The square root of 5267126767 is about 72574.9734205945. The cubic root of 5267126767 is about 1739.9012106462.
The spelling of 5267126767 in words is "five billion, two hundred sixty-seven million, one hundred twenty-six thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •