Base | Representation |
---|---|
bin | 100100110000101011001… |
… | …0111000111011001110111 |
3 | 122212222221121001221011011 |
4 | 1021201112113013121313 |
5 | 1130234133043042221 |
6 | 14425001503253051 |
7 | 1031006313110410 |
oct | 111412627073167 |
9 | 18788847057134 |
10 | 5052330440311 |
11 | 1678754901940 |
12 | 6972132aa187 |
13 | 2a85818a664b |
14 | 1367697ca807 |
15 | 8b65199c1e1 |
hex | 498565c7677 |
5052330440311 has 32 divisors (see below), whose sum is σ = 6334974696960. Its totient is φ = 3914462630400.
The previous prime is 5052330440299. The next prime is 5052330440323. The reversal of 5052330440311 is 1130440332505.
It is an interprime number because it is at equal distance from previous prime (5052330440299) and next prime (5052330440323).
It is not a de Polignac number, because 5052330440311 - 225 = 5052296885879 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5052330440371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9854475 + ... + 10354483.
It is an arithmetic number, because the mean of its divisors is an integer number (197967959280).
Almost surely, 25052330440311 is an apocalyptic number.
5052330440311 is a deficient number, since it is larger than the sum of its proper divisors (1282644256649).
5052330440311 is a wasteful number, since it uses less digits than its factorization.
5052330440311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500775.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 5052330440311 its reverse (1130440332505), we get a palindrome (6182770772816).
The spelling of 5052330440311 in words is "five trillion, fifty-two billion, three hundred thirty million, four hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •