Base | Representation |
---|---|
bin | 1001110100000011… |
… | …11111011010110011 |
3 | 111121011201222020012 |
4 | 10322001333122303 |
5 | 41242223131411 |
6 | 2230443405135 |
7 | 244363041530 |
oct | 47201773263 |
9 | 14534658205 |
10 | 5268567731 |
11 | 2263a72a09 |
12 | 10305237ab |
13 | 65c6a27cb |
14 | 37da11d87 |
15 | 20c80718b |
hex | 13a07f6b3 |
5268567731 has 8 divisors (see below), whose sum is σ = 6021738240. Its totient is φ = 4515526728.
The previous prime is 5268567673. The next prime is 5268567739. The reversal of 5268567731 is 1377658625.
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 5268567731 - 214 = 5268551347 is a prime.
It is a super-2 number, since 2×52685677312 = 55515611872268976722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5268567731.
It is not an unprimeable number, because it can be changed into a prime (5268567739) 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 7 ways as a sum of consecutive naturals, for example, 81530 + ... + 131088.
It is an arithmetic number, because the mean of its divisors is an integer number (752717280).
Almost surely, 25268567731 is an apocalyptic number.
5268567731 is a deficient number, since it is larger than the sum of its proper divisors (753170509).
5268567731 is a wasteful number, since it uses less digits than its factorization.
5268567731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64753.
The product of its digits is 2116800, while the sum is 50.
The square root of 5268567731 is about 72584.9001583663. The cubic root of 5268567731 is about 1740.0598617491.
The spelling of 5268567731 in words is "five billion, two hundred sixty-eight million, five hundred sixty-seven thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •