Base | Representation |
---|---|
bin | 100110011101000001111… |
… | …1011000010000011001111 |
3 | 200201020120100021222201000 |
4 | 1030322003323002003033 |
5 | 1143042211401024041 |
6 | 15123523413551343 |
7 | 1053554540556036 |
oct | 114720373020317 |
9 | 20636510258630 |
10 | 5285023064271 |
11 | 1758402815325 |
12 | 714333645553 |
13 | 2c44b6090c12 |
14 | 143b2178971d |
15 | 92720124bb6 |
hex | 4ce83ec20cf |
5285023064271 has 48 divisors (see below), whose sum is σ = 8474255834400. Its totient is φ = 3253524857856.
The previous prime is 5285023064263. The next prime is 5285023064281. The reversal of 5285023064271 is 1724603205825.
5285023064271 is a `hidden beast` number, since 5 + 2 + 8 + 502 + 30 + 6 + 42 + 71 = 666.
It is not a de Polignac number, because 5285023064271 - 23 = 5285023064263 is a prime.
It is a super-2 number, since 2×52850230642712 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5285023064221) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5976126 + ... + 6803243.
It is an arithmetic number, because the mean of its divisors is an integer number (176546996550).
Almost surely, 25285023064271 is an apocalyptic number.
5285023064271 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5285023064271 is a deficient number, since it is larger than the sum of its proper divisors (3189232770129).
5285023064271 is a wasteful number, since it uses less digits than its factorization.
5285023064271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12779465 (or 12779442 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 45.
The spelling of 5285023064271 in words is "five trillion, two hundred eighty-five billion, twenty-three million, sixty-four thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •