Base | Representation |
---|---|
bin | 1000010111010110… |
… | …10000100111110011 |
3 | 102120222100011121002 |
4 | 10023223100213303 |
5 | 33144124410242 |
6 | 2021342352215 |
7 | 216200440253 |
oct | 41353204763 |
9 | 12528304532 |
10 | 4490856947 |
11 | 19a4a76325 |
12 | a53b8b66b |
13 | 567525005 |
14 | 308609963 |
15 | 1b43d4432 |
hex | 10bad09f3 |
4490856947 has 2 divisors, whose sum is σ = 4490856948. Its totient is φ = 4490856946.
The previous prime is 4490856917. The next prime is 4490856983. The reversal of 4490856947 is 7496580944.
4490856947 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4490856947 - 26 = 4490856883 is a prime.
It is a super-2 number, since 2×44908569472 = 40335592236836321618, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4490856892 and 4490856901.
It is not a weakly prime, because it can be changed into another prime (4490856917) 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, 2245428473 + 2245428474.
It is an arithmetic number, because the mean of its divisors is an integer number (2245428474).
Almost surely, 24490856947 is an apocalyptic number.
4490856947 is a deficient number, since it is larger than the sum of its proper divisors (1).
4490856947 is an equidigital number, since it uses as much as digits as its factorization.
4490856947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8709120, while the sum is 56.
The square root of 4490856947 is about 67013.8563806024. The cubic root of 4490856947 is about 1649.8447294355.
The spelling of 4490856947 in words is "four billion, four hundred ninety million, eight hundred fifty-six thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •