Base | Representation |
---|---|
bin | 100110011000001111100… |
… | …1100100000010000110011 |
3 | 200200021000220221100010212 |
4 | 1030300133030200100303 |
5 | 1142410133230223214 |
6 | 15115103353014335 |
7 | 1053042024344360 |
oct | 114603714402063 |
9 | 20607026840125 |
10 | 5274743211059 |
11 | 1754008037473 |
12 | 7123449b43ab |
13 | 2c353840ab3a |
14 | 1434283b9467 |
15 | 9231c8d753e |
hex | 4cc1f320433 |
5274743211059 has 8 divisors (see below), whose sum is σ = 6083583258720. Its totient is φ = 4479729489216.
The previous prime is 5274743211037. The next prime is 5274743211083. The reversal of 5274743211059 is 9501123474725.
It is a happy number.
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 5274743211059 - 240 = 4175231583283 is a prime.
It is a super-2 number, since 2×52747432110592 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5274743210998 and 5274743211016.
It is not an unprimeable number, because it can be changed into a prime (5274743211019) 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, 3456580634 + ... + 3456582159.
It is an arithmetic number, because the mean of its divisors is an integer number (760447907340).
Almost surely, 25274743211059 is an apocalyptic number.
5274743211059 is a deficient number, since it is larger than the sum of its proper divisors (808840047661).
5274743211059 is a wasteful number, since it uses less digits than its factorization.
5274743211059 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6913162909.
The product of its (nonzero) digits is 2116800, while the sum is 50.
The spelling of 5274743211059 in words is "five trillion, two hundred seventy-four billion, seven hundred forty-three million, two hundred eleven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •