Base | Representation |
---|---|
bin | 1111110010101001… |
… | …0011011000001001 |
3 | 101221102022212021111 |
4 | 3330222103120021 |
5 | 32140132312344 |
6 | 1540343210321 |
7 | 210021314353 |
oct | 37452233011 |
9 | 11842285244 |
10 | 4238947849 |
11 | 1885859294 |
12 | 9a37469a1 |
13 | 527294686 |
14 | 2c2d940d3 |
15 | 19c224834 |
hex | fca93609 |
4238947849 has 2 divisors, whose sum is σ = 4238947850. Its totient is φ = 4238947848.
The previous prime is 4238947847. The next prime is 4238947871. The reversal of 4238947849 is 9487498324.
4238947849 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2450250000 + 1788697849 = 49500^2 + 42293^2 .
It is a cyclic number.
It is not a de Polignac number, because 4238947849 - 21 = 4238947847 is a prime.
Together with 4238947847, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4238947793 and 4238947802.
It is not a weakly prime, because it can be changed into another prime (4238947847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2119473924 + 2119473925.
It is an arithmetic number, because the mean of its divisors is an integer number (2119473925).
Almost surely, 24238947849 is an apocalyptic number.
It is an amenable number.
4238947849 is a deficient number, since it is larger than the sum of its proper divisors (1).
4238947849 is an equidigital number, since it uses as much as digits as its factorization.
4238947849 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13934592, while the sum is 58.
The square root of 4238947849 is about 65107.2027428609. The cubic root of 4238947849 is about 1618.4005766980.
The spelling of 4238947849 in words is "four billion, two hundred thirty-eight million, nine hundred forty-seven thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •