Base | Representation |
---|---|
bin | 100101001100100001111… |
… | …1000110010001111010000 |
3 | 200002201100112012112022212 |
4 | 1022121003320302033100 |
5 | 1132224140402312202 |
6 | 14512253405051252 |
7 | 1035224562246251 |
oct | 112310370621720 |
9 | 20081315175285 |
10 | 5112150041552 |
11 | 16a1061474714 |
12 | 6a6928856b28 |
13 | 2b10c5b502b8 |
14 | 139602320b28 |
15 | 8cea3468652 |
hex | 4a643e323d0 |
5112150041552 has 20 divisors (see below), whose sum is σ = 10040472772260. Its totient is φ = 2521060293888.
The previous prime is 5112150041549. The next prime is 5112150041597. The reversal of 5112150041552 is 2551400512115.
It can be written as a sum of positive squares in 2 ways, for example, as 3087175505296 + 2024974536256 = 1757036^2 + 1423016^2 .
It is a super-2 number, since 2×51121500415522 (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 (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2188419227 + ... + 2188421562.
It is an arithmetic number, because the mean of its divisors is an integer number (502023638613).
Almost surely, 25112150041552 is an apocalyptic number.
It is an amenable number.
5112150041552 is a deficient number, since it is larger than the sum of its proper divisors (4928322730708).
5112150041552 is a wasteful number, since it uses less digits than its factorization.
5112150041552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4376840870 (or 4376840864 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 32.
Adding to 5112150041552 its reverse (2551400512115), we get a palindrome (7663550553667).
The spelling of 5112150041552 in words is "five trillion, one hundred twelve billion, one hundred fifty million, forty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •