Base | Representation |
---|---|
bin | 101000111011111000011… |
… | …1000001001111100110101 |
3 | 201220212002022021202020002 |
4 | 1101313300320021330311 |
5 | 1214134330240140000 |
6 | 15544341425521045 |
7 | 1120322220132365 |
oct | 121676070117465 |
9 | 21825068252202 |
10 | 5626153443125 |
11 | 187a046a43a66 |
12 | 76a4774a3185 |
13 | 31a70c1cb2b7 |
14 | 1564432649a5 |
15 | 9b5386528d5 |
hex | 51df0e09f35 |
5626153443125 has 10 divisors (see below), whose sum is σ = 7030441343310. Its totient is φ = 4500922754000.
The previous prime is 5626153443017. The next prime is 5626153443143. The reversal of 5626153443125 is 5213443516265.
It can be written as a sum of positive squares in 5 ways, for example, as 3613276343044 + 2012877100081 = 1900862^2 + 1418759^2 .
It is not a de Polignac number, because 5626153443125 - 28 = 5626153442869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5626153443125.
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 in 9 ways as a sum of consecutive naturals, for example, 4500922130 + ... + 4500923379.
It is an arithmetic number, because the mean of its divisors is an integer number (703044134331).
Almost surely, 25626153443125 is an apocalyptic number.
It is an amenable number.
5626153443125 is a deficient number, since it is larger than the sum of its proper divisors (1404287900185).
5626153443125 is an frugal number, since it uses more digits than its factorization.
5626153443125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9001845529 (or 9001845514 counting only the distinct ones).
The product of its digits is 2592000, while the sum is 47.
The spelling of 5626153443125 in words is "five trillion, six hundred twenty-six billion, one hundred fifty-three million, four hundred forty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •