Base | Representation |
---|---|
bin | 1111010111010101… |
… | …1111110000001011 |
3 | 101122102212100020201 |
4 | 3311311133300023 |
5 | 31421324112421 |
6 | 1521133033031 |
7 | 204131114053 |
oct | 36565376013 |
9 | 11572770221 |
10 | 4124441611 |
11 | 182715a034 |
12 | 971325777 |
13 | 5096421c4 |
14 | 2b1aa8563 |
15 | 192156b91 |
hex | f5d5fc0b |
4124441611 has 2 divisors, whose sum is σ = 4124441612. Its totient is φ = 4124441610.
The previous prime is 4124441569. The next prime is 4124441623. The reversal of 4124441611 is 1161444214.
4124441611 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 is a cyclic number.
It is not a de Polignac number, because 4124441611 - 27 = 4124441483 is a prime.
It is a super-2 number, since 2×41244416112 = 34022037205096550642, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4124441611.
It is not a weakly prime, because it can be changed into another prime (4124441641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2062220805 + 2062220806.
It is an arithmetic number, because the mean of its divisors is an integer number (2062220806).
Almost surely, 24124441611 is an apocalyptic number.
4124441611 is a deficient number, since it is larger than the sum of its proper divisors (1).
4124441611 is an equidigital number, since it uses as much as digits as its factorization.
4124441611 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3072, while the sum is 28.
The square root of 4124441611 is about 64221.8156937345. The cubic root of 4124441611 is about 1603.6947959995.
Adding to 4124441611 its reverse (1161444214), we get a palindrome (5285885825).
The spelling of 4124441611 in words is "four billion, one hundred twenty-four million, four hundred forty-one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •