Base | Representation |
---|---|
bin | 1111010110001000… |
… | …0100101100011111 |
3 | 101122002021122221021 |
4 | 3311202010230133 |
5 | 31414023200142 |
6 | 1520431545011 |
7 | 204036616621 |
oct | 36542045437 |
9 | 11562248837 |
10 | 4119350047 |
11 | 18242a172a |
12 | 96b68b167 |
13 | 50857b847 |
14 | 2b1140c11 |
15 | 19199d267 |
hex | f5884b1f |
4119350047 has 2 divisors, whose sum is σ = 4119350048. Its totient is φ = 4119350046.
The previous prime is 4119350033. The next prime is 4119350057. The reversal of 4119350047 is 7400539114.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4119350047 - 27 = 4119349919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4119349994 and 4119350021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4119350057) 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, 2059675023 + 2059675024.
It is an arithmetic number, because the mean of its divisors is an integer number (2059675024).
Almost surely, 24119350047 is an apocalyptic number.
4119350047 is a deficient number, since it is larger than the sum of its proper divisors (1).
4119350047 is an equidigital number, since it uses as much as digits as its factorization.
4119350047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 4119350047 is about 64182.1629972066. The cubic root of 4119350047 is about 1603.0346115225.
The spelling of 4119350047 in words is "four billion, one hundred nineteen million, three hundred fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •