Base | Representation |
---|---|
bin | 1110011001110010… |
… | …1000001110000001 |
3 | 100222110001120202121 |
4 | 3212130220032001 |
5 | 30404230430244 |
6 | 1435351244241 |
7 | 164544464005 |
oct | 34634501601 |
9 | 10873046677 |
10 | 3866264449 |
11 | 1704450783 |
12 | 8ba979681 |
13 | 497cc8858 |
14 | 2896a0705 |
15 | 179659c84 |
hex | e6728381 |
3866264449 has 2 divisors, whose sum is σ = 3866264450. Its totient is φ = 3866264448.
The previous prime is 3866264447. The next prime is 3866264473. The reversal of 3866264449 is 9444626683.
3866264449 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 can be written as a sum of positive squares in only one way, i.e., 3864860224 + 1404225 = 62168^2 + 1185^2 .
It is a cyclic number.
It is not a de Polignac number, because 3866264449 - 21 = 3866264447 is a prime.
Together with 3866264447, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3866264396 and 3866264405.
It is not a weakly prime, because it can be changed into another prime (3866264443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1933132224 + 1933132225.
It is an arithmetic number, because the mean of its divisors is an integer number (1933132225).
Almost surely, 23866264449 is an apocalyptic number.
It is an amenable number.
3866264449 is a deficient number, since it is larger than the sum of its proper divisors (1).
3866264449 is an equidigital number, since it uses as much as digits as its factorization.
3866264449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5971968, while the sum is 52.
The square root of 3866264449 is about 62179.2927669654. The cubic root of 3866264449 is about 1569.5091503810.
The spelling of 3866264449 in words is "three billion, eight hundred sixty-six million, two hundred sixty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •