Base | Representation |
---|---|
bin | 1001100010100011… |
… | …01101110101010110 |
3 | 111012221101001210201 |
4 | 10301101231311112 |
5 | 40442123220222 |
6 | 2204115411114 |
7 | 240630455401 |
oct | 46121556526 |
9 | 14187331721 |
10 | 5121695062 |
11 | 2199077340 |
12 | bab2b3a9a |
13 | 63812a1c3 |
14 | 3682dcd38 |
15 | 1ee994427 |
hex | 13146dd56 |
5121695062 has 32 divisors (see below), whose sum is σ = 9205643520. Its totient is φ = 2109618720.
The previous prime is 5121695023. The next prime is 5121695071. The reversal of 5121695062 is 2605961215.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 256753 + ... + 275980.
It is an arithmetic number, because the mean of its divisors is an integer number (287676360).
Almost surely, 25121695062 is an apocalyptic number.
5121695062 is a deficient number, since it is larger than the sum of its proper divisors (4083948458).
5121695062 is a wasteful number, since it uses less digits than its factorization.
5121695062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532788.
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 5121695062 is about 71566.0189056231. The cubic root of 5121695062 is about 1723.7379341839.
The spelling of 5121695062 in words is "five billion, one hundred twenty-one million, six hundred ninety-five thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •