Base | Representation |
---|---|
bin | 1000101101111110… |
… | …00110010011100111 |
3 | 110002012101110200000 |
4 | 10112333012103213 |
5 | 34041213410301 |
6 | 2052241352343 |
7 | 223663334256 |
oct | 42677062347 |
9 | 13065343600 |
10 | 4680606951 |
11 | 1a92098309 |
12 | aa76386b3 |
13 | 597930a17 |
14 | 3258c079d |
15 | 1c5db6786 |
hex | 116fc64e7 |
4680606951 has 24 divisors (see below), whose sum is σ = 7237461504. Its totient is φ = 3019741560.
The previous prime is 4680606941. The next prime is 4680606961. The reversal of 4680606951 is 1596060864.
It is an interprime number because it is at equal distance from previous prime (4680606941) and next prime (4680606961).
It is not a de Polignac number, because 4680606951 - 213 = 4680598759 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4680606897 and 4680606906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4680606941) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 303141 + ... + 318206.
It is an arithmetic number, because the mean of its divisors is an integer number (301560896).
Almost surely, 24680606951 is an apocalyptic number.
4680606951 is a deficient number, since it is larger than the sum of its proper divisors (2556854553).
4680606951 is an equidigital number, since it uses as much as digits as its factorization.
4680606951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621393 (or 621381 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 4680606951 is about 68414.9614558102. The cubic root of 4680606951 is about 1672.7616289219.
The spelling of 4680606951 in words is "four billion, six hundred eighty million, six hundred six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •