Base | Representation |
---|---|
bin | 100100011111011111001… |
… | …1001010001011100110001 |
3 | 122202110200022200201121100 |
4 | 1020332332121101130301 |
5 | 1124133040302134140 |
6 | 14400015212515013 |
7 | 1025231545131330 |
oct | 110767631213461 |
9 | 18673608621540 |
10 | 5015421130545 |
11 | 1664034527151 |
12 | 69003247ba69 |
13 | 2a4c4bc3c797 |
14 | 134a678b1d17 |
15 | 8a6e14c0530 |
hex | 48fbe651731 |
5015421130545 has 48 divisors (see below), whose sum is σ = 10519740466560. Its totient is φ = 2157895475712.
The previous prime is 5015421130537. The next prime is 5015421130561. The reversal of 5015421130545 is 5450311245105.
5015421130545 is a `hidden beast` number, since 50 + 1 + 5 + 421 + 130 + 54 + 5 = 666.
It is not a de Polignac number, because 5015421130545 - 23 = 5015421130537 is a prime.
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 47 ways as a sum of consecutive naturals, for example, 468287935 + ... + 468298644.
It is an arithmetic number, because the mean of its divisors is an integer number (219161259720).
Almost surely, 25015421130545 is an apocalyptic number.
It is an amenable number.
5015421130545 is an abundant number, since it is smaller than the sum of its proper divisors (5504319336015).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5015421130545 is a wasteful number, since it uses less digits than its factorization.
5015421130545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936586614 (or 936586611 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 5015421130545 in words is "five trillion, fifteen billion, four hundred twenty-one million, one hundred thirty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •