Base | Representation |
---|---|
bin | 1101110111001110… |
… | …0100101101100001 |
3 | 100121100020211120222 |
4 | 3131303210231201 |
5 | 30110122100244 |
6 | 1413132012425 |
7 | 161134252541 |
oct | 33563445541 |
9 | 10540224528 |
10 | 3721284449 |
11 | 163a6280a3 |
12 | 87a301115 |
13 | 473c6687c |
14 | 274321321 |
15 | 16ba6cbee |
hex | ddce4b61 |
3721284449 has 2 divisors, whose sum is σ = 3721284450. Its totient is φ = 3721284448.
The previous prime is 3721284407. The next prime is 3721284487. The reversal of 3721284449 is 9444821273.
3721284449 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2773075600 + 948208849 = 52660^2 + 30793^2 .
It is a cyclic number.
It is not a de Polignac number, because 3721284449 - 220 = 3720235873 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (3721284949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1860642224 + 1860642225.
It is an arithmetic number, because the mean of its divisors is an integer number (1860642225).
Almost surely, 23721284449 is an apocalyptic number.
It is an amenable number.
3721284449 is a deficient number, since it is larger than the sum of its proper divisors (1).
3721284449 is an equidigital number, since it uses as much as digits as its factorization.
3721284449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 387072, while the sum is 44.
The square root of 3721284449 is about 61002.3315046237. The cubic root of 3721284449 is about 1549.6404922724.
It can be divided in two parts, 372 and 1284449, that added together give a palindrome (1284821).
The spelling of 3721284449 in words is "three billion, seven hundred twenty-one million, two hundred eighty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.957 sec. • engine limits •