Base | Representation |
---|---|
bin | 1110010101111110… |
… | …0001001100000101 |
3 | 100221022220201000211 |
4 | 3211133201030011 |
5 | 30341130313434 |
6 | 1434020035421 |
7 | 164261353462 |
oct | 34537411405 |
9 | 10838821024 |
10 | 3850244869 |
11 | 16a63a9a59 |
12 | 8b5532b71 |
13 | 4948aa103 |
14 | 2874d0669 |
15 | 178043464 |
hex | e57e1305 |
3850244869 has 2 divisors, whose sum is σ = 3850244870. Its totient is φ = 3850244868.
The previous prime is 3850244831. The next prime is 3850244891. The reversal of 3850244869 is 9684420583.
3850244869 is digitally balanced in base 2, 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., 2294889025 + 1555355844 = 47905^2 + 39438^2 .
It is a cyclic number.
It is not a de Polignac number, because 3850244869 - 215 = 3850212101 is a prime.
It is a super-2 number, since 2×38502448692 = 29648771102521654322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3850244809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1925122434 + 1925122435.
It is an arithmetic number, because the mean of its divisors is an integer number (1925122435).
Almost surely, 23850244869 is an apocalyptic number.
It is an amenable number.
3850244869 is a deficient number, since it is larger than the sum of its proper divisors (1).
3850244869 is an equidigital number, since it uses as much as digits as its factorization.
3850244869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1658880, while the sum is 49.
The square root of 3850244869 is about 62050.3414092139. The cubic root of 3850244869 is about 1567.3384346279.
The spelling of 3850244869 in words is "three billion, eight hundred fifty million, two hundred forty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •