Base | Representation |
---|---|
bin | 1001001101000000… |
… | …11000010010100001 |
3 | 110202100100021111212 |
4 | 10212200120102201 |
5 | 40104343131401 |
6 | 2134142315505 |
7 | 233304501332 |
oct | 44640302241 |
9 | 13670307455 |
10 | 4940989601 |
11 | 2106072689 |
12 | b5a888b95 |
13 | 60986a1b2 |
14 | 34c300289 |
15 | 1ddb9bdbb |
hex | 1268184a1 |
4940989601 has 2 divisors, whose sum is σ = 4940989602. Its totient is φ = 4940989600.
The previous prime is 4940989567. The next prime is 4940989609. The reversal of 4940989601 is 1069890494.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4883214400 + 57775201 = 69880^2 + 7601^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4940989601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4940989601.
It is not a weakly prime, because it can be changed into another prime (4940989609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2470494800 + 2470494801.
It is an arithmetic number, because the mean of its divisors is an integer number (2470494801).
Almost surely, 24940989601 is an apocalyptic number.
It is an amenable number.
4940989601 is a deficient number, since it is larger than the sum of its proper divisors (1).
4940989601 is an equidigital number, since it uses as much as digits as its factorization.
4940989601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 50.
The square root of 4940989601 is about 70292.1731133702. The cubic root of 4940989601 is about 1703.2222163651. Note that the first 4 decimals are identical.
The spelling of 4940989601 in words is "four billion, nine hundred forty million, nine hundred eighty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •