Base | Representation |
---|---|
bin | 1001000101000110… |
… | …10111101100011011 |
3 | 110120201112121220012 |
4 | 10202203113230123 |
5 | 34440403232411 |
6 | 2123412552135 |
7 | 231540652346 |
oct | 44243275433 |
9 | 13521477805 |
10 | 4874664731 |
11 | 2081691842 |
12 | b4062264b |
13 | 5c8bb7401 |
14 | 34359745d |
15 | 1d7e4a18b |
hex | 1228d7b1b |
4874664731 has 2 divisors, whose sum is σ = 4874664732. Its totient is φ = 4874664730.
The previous prime is 4874664713. The next prime is 4874664787. The reversal of 4874664731 is 1374664784.
Together with previous prime (4874664713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4874664731 - 210 = 4874663707 is a prime.
It is a super-2 number, since 2×48746647312 = 47524712479310604722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4874664731.
It is not a weakly prime, because it can be changed into another prime (4874664791) by changing a digit.
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 as a sum of consecutive naturals, namely, 2437332365 + 2437332366.
It is an arithmetic number, because the mean of its divisors is an integer number (2437332366).
Almost surely, 24874664731 is an apocalyptic number.
4874664731 is a deficient number, since it is larger than the sum of its proper divisors (1).
4874664731 is an equidigital number, since it uses as much as digits as its factorization.
4874664731 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2709504, while the sum is 50.
The square root of 4874664731 is about 69818.7992663867. The cubic root of 4874664731 is about 1695.5668499127.
The spelling of 4874664731 in words is "four billion, eight hundred seventy-four million, six hundred sixty-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •