Base | Representation |
---|---|
bin | 100101010000010110111… |
… | …0110010000101101011101 |
3 | 200010111120101220122110221 |
4 | 1022200231312100231131 |
5 | 1132343004233401043 |
6 | 14520133212001341 |
7 | 1035635355466621 |
oct | 112405566205535 |
9 | 20114511818427 |
10 | 5120370215773 |
11 | 16a459a55422a |
12 | 6a8441760251 |
13 | 2b1b05b92207 |
14 | 139b81d3d181 |
15 | 8d2d4e558ed |
hex | 4a82dd90b5d |
5120370215773 has 32 divisors (see below), whose sum is σ = 5355511603200. Its totient is φ = 4891707804480.
The previous prime is 5120370215743. The next prime is 5120370215789. The reversal of 5120370215773 is 3775120730215.
It is a cyclic number.
It is not a de Polignac number, because 5120370215773 - 237 = 4982931262301 is a prime.
It is a super-2 number, since 2×51203702157732 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5120370215743) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 392569590 + ... + 392582632.
It is an arithmetic number, because the mean of its divisors is an integer number (167359737600).
Almost surely, 25120370215773 is an apocalyptic number.
It is an amenable number.
5120370215773 is a deficient number, since it is larger than the sum of its proper divisors (235141387427).
5120370215773 is a wasteful number, since it uses less digits than its factorization.
5120370215773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14169.
The product of its (nonzero) digits is 308700, while the sum is 43.
Adding to 5120370215773 its reverse (3775120730215), we get a palindrome (8895490945988).
The spelling of 5120370215773 in words is "five trillion, one hundred twenty billion, three hundred seventy million, two hundred fifteen thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •