Base | Representation |
---|---|
bin | 1111010100001100… |
… | …0010011110011001 |
3 | 101121111222100001022 |
4 | 3311003002132121 |
5 | 31404432330424 |
6 | 1515541332225 |
7 | 203610514034 |
oct | 36503023631 |
9 | 11544870038 |
10 | 4111214489 |
11 | 181a745328 |
12 | 968a07075 |
13 | 5069907c5 |
14 | 2b002401b |
15 | 190de295e |
hex | f50c2799 |
4111214489 has 2 divisors, whose sum is σ = 4111214490. Its totient is φ = 4111214488.
The previous prime is 4111214467. The next prime is 4111214507. The reversal of 4111214489 is 9844121114.
4111214489 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., 2396592025 + 1714622464 = 48955^2 + 41408^2 .
It is a cyclic number.
It is not a de Polignac number, because 4111214489 - 224 = 4094437273 is a prime.
It is a super-2 number, since 2×41112144892 = 33804169149127062242, which contains 22 as substring.
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 (4111214449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2055607244 + 2055607245.
It is an arithmetic number, because the mean of its divisors is an integer number (2055607245).
Almost surely, 24111214489 is an apocalyptic number.
It is an amenable number.
4111214489 is a deficient number, since it is larger than the sum of its proper divisors (1).
4111214489 is an equidigital number, since it uses as much as digits as its factorization.
4111214489 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9216, while the sum is 35.
The square root of 4111214489 is about 64118.7530212496. The cubic root of 4111214489 is about 1601.9786054469.
The spelling of 4111214489 in words is "four billion, one hundred eleven million, two hundred fourteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •