Base | Representation |
---|---|
bin | 100100110000101011001… |
… | …1001101001100100010111 |
3 | 122212222221122022200022001 |
4 | 1021201112121221210113 |
5 | 1130234133230321120 |
6 | 14425001525420131 |
7 | 1031006321545051 |
oct | 111412631514427 |
9 | 18788848280261 |
10 | 5052331104535 |
11 | 1678755215990 |
12 | 69721356a647 |
13 | 2a8581a79a90 |
14 | 1367699208d1 |
15 | 8b651a7de0a |
hex | 49856669917 |
5052331104535 has 32 divisors (see below), whose sum is σ = 7123005755712. Its totient is φ = 3391641953280.
The previous prime is 5052331104533. The next prime is 5052331104589. The reversal of 5052331104535 is 5354011332505.
It is not a de Polignac number, because 5052331104535 - 21 = 5052331104533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5052331104494 and 5052331104503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5052331104533) 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, 20236987 + ... + 20485123.
It is an arithmetic number, because the mean of its divisors is an integer number (222593929866).
Almost surely, 25052331104535 is an apocalyptic number.
5052331104535 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5052331104535 is a deficient number, since it is larger than the sum of its proper divisors (2070674651177).
5052331104535 is a wasteful number, since it uses less digits than its factorization.
5052331104535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276643.
The product of its (nonzero) digits is 135000, while the sum is 37.
It can be divided in two parts, 5052331 and 104535, that added together give a triangular number (5156866 = T3211).
The spelling of 5052331104535 in words is "five trillion, fifty-two billion, three hundred thirty-one million, one hundred four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •