Base | Representation |
---|---|
bin | 1001001100011011… |
… | …10000000100011101 |
3 | 110202000011011211201 |
4 | 10212031300010131 |
5 | 40102120400034 |
6 | 2133445515501 |
7 | 233215132243 |
oct | 44615600435 |
9 | 13660134751 |
10 | 4936106269 |
11 | 2103337776 |
12 | b59112b91 |
13 | 60884a553 |
14 | 34b7cc793 |
15 | 1dd535014 |
hex | 12637011d |
4936106269 has 8 divisors (see below), whose sum is σ = 5132243160. Its totient is φ = 4741697856.
The previous prime is 4936106257. The next prime is 4936106297. The reversal of 4936106269 is 9626016394.
It can be written as a sum of positive squares in 4 ways, for example, as 2725884100 + 2210222169 = 52210^2 + 47013^2 .
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 4936106269 - 27 = 4936106141 is a prime.
It is a super-2 number, since 2×49361062692 = 48730290197722200722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4936106369) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 426294 + ... + 437719.
It is an arithmetic number, because the mean of its divisors is an integer number (641530395).
Almost surely, 24936106269 is an apocalyptic number.
It is an amenable number.
4936106269 is a deficient number, since it is larger than the sum of its proper divisors (196136891).
4936106269 is a wasteful number, since it uses less digits than its factorization.
4936106269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 864239.
The product of its (nonzero) digits is 419904, while the sum is 46.
The square root of 4936106269 is about 70257.4285680881. The cubic root of 4936106269 is about 1702.6609157726.
The spelling of 4936106269 in words is "four billion, nine hundred thirty-six million, one hundred six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •