Base | Representation |
---|---|
bin | 100101011111011000100… |
… | …0101111000000000100101 |
3 | 200020120212010100210120111 |
4 | 1022332301011320000211 |
5 | 1133410100021122034 |
6 | 14543031054533021 |
7 | 1041160100651533 |
oct | 112766105700045 |
9 | 20216763323514 |
10 | 5152636895269 |
11 | 17072482200a6 |
12 | 6b2747807171 |
13 | 2b4b78a33c86 |
14 | 13b563421153 |
15 | 8e072a6d364 |
hex | 4afb1178025 |
5152636895269 has 8 divisors (see below), whose sum is σ = 5456112023808. Its totient is φ = 4849203860160.
The previous prime is 5152636895267. The next prime is 5152636895299. The reversal of 5152636895269 is 9625986362515.
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 5152636895269 - 21 = 5152636895267 is a prime.
It is a super-2 number, since 2×51526368952692 (a number of 26 digits) 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 (5152636895261) 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, 10271157 + ... + 10761130.
It is an arithmetic number, because the mean of its divisors is an integer number (682014002976).
Almost surely, 25152636895269 is an apocalyptic number.
It is an amenable number.
5152636895269 is a deficient number, since it is larger than the sum of its proper divisors (303475128539).
5152636895269 is a wasteful number, since it uses less digits than its factorization.
5152636895269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21046715.
The product of its digits is 209952000, while the sum is 67.
The spelling of 5152636895269 in words is "five trillion, one hundred fifty-two billion, six hundred thirty-six million, eight hundred ninety-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •