Base | Representation |
---|---|
bin | 100100100110111110101… |
… | …1101010010111010010100 |
3 | 122211000012200121222100102 |
4 | 1021031331131102322110 |
5 | 1124414013423112002 |
6 | 14411240002033232 |
7 | 1026341355251246 |
oct | 111157535227224 |
9 | 18730180558312 |
10 | 5031511535252 |
11 | 166a9410aa384 |
12 | 693183048818 |
13 | 2a6614659c07 |
14 | 135752858096 |
15 | 8ad33dc2a02 |
hex | 4937d752e94 |
5031511535252 has 6 divisors (see below), whose sum is σ = 8805145186698. Its totient is φ = 2515755767624.
The previous prime is 5031511535233. The next prime is 5031511535261. The reversal of 5031511535252 is 2525351151305.
It can be written as a sum of positive squares in only one way, i.e., 4950073215376 + 81438319876 = 2224876^2 + 285374^2 .
It is a super-2 number, since 2×50315115352522 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 628938941903 + ... + 628938941910.
It is an arithmetic number, because the mean of its divisors is an integer number (1467524197783).
Almost surely, 25031511535252 is an apocalyptic number.
It is an amenable number.
5031511535252 is a deficient number, since it is larger than the sum of its proper divisors (3773633651446).
5031511535252 is a wasteful number, since it uses less digits than its factorization.
5031511535252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1257877883817 (or 1257877883815 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 38.
Adding to 5031511535252 its reverse (2525351151305), we get a palindrome (7556862686557).
The spelling of 5031511535252 in words is "five trillion, thirty-one billion, five hundred eleven million, five hundred thirty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •