Base | Representation |
---|---|
bin | 100101001001101100001… |
… | …1000110001101110011000 |
3 | 200002010121111202121110022 |
4 | 1022103120120301232120 |
5 | 1132124143142141212 |
6 | 14505404312410012 |
7 | 1034620500551231 |
oct | 112233030615630 |
9 | 20063544677408 |
10 | 5106051521432 |
11 | 1699511a73244 |
12 | 6a57063a6908 |
13 | 2b066353b504 |
14 | 1391c43c8088 |
15 | 8cc47d6e772 |
hex | 4a4d8631b98 |
5106051521432 has 32 divisors (see below), whose sum is σ = 9804000531600. Its totient is φ = 2492140420224.
The previous prime is 5106051521413. The next prime is 5106051521453. The reversal of 5106051521432 is 2341251506015.
It is a junction number, because it is equal to n+sod(n) for n = 5106051521392 and 5106051521401.
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 7 ways as a sum of consecutive naturals, for example, 30481382 + ... + 30648437.
Almost surely, 25106051521432 is an apocalyptic number.
It is an amenable number.
5106051521432 is a deficient number, since it is larger than the sum of its proper divisors (4697949010168).
5106051521432 is a wasteful number, since it uses less digits than its factorization.
5106051521432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61130075 (or 61130071 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 5106051521432 in words is "five trillion, one hundred six billion, fifty-one million, five hundred twenty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •