Base | Representation |
---|---|
bin | 1111010001110011… |
… | …1000001110111101 |
3 | 101120211011002221021 |
4 | 3310130320032331 |
5 | 31344402223234 |
6 | 1514543104141 |
7 | 203426501404 |
oct | 36434701675 |
9 | 11524132837 |
10 | 4101211069 |
11 | 181503263a |
12 | 9655a2051 |
13 | 50489a517 |
14 | 2ac97c63b |
15 | 1900b89b4 |
hex | f47383bd |
4101211069 has 2 divisors, whose sum is σ = 4101211070. Its totient is φ = 4101211068.
The previous prime is 4101211067. The next prime is 4101211139. The reversal of 4101211069 is 9601121014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4096640025 + 4571044 = 64005^2 + 2138^2 .
It is a cyclic number.
It is not a de Polignac number, because 4101211069 - 21 = 4101211067 is a prime.
It is a super-2 number, since 2×41012110692 = 33639864464976245522, which contains 22 as substring.
Together with 4101211067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4101211067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2050605534 + 2050605535.
It is an arithmetic number, because the mean of its divisors is an integer number (2050605535).
Almost surely, 24101211069 is an apocalyptic number.
It is an amenable number.
4101211069 is a deficient number, since it is larger than the sum of its proper divisors (1).
4101211069 is an equidigital number, since it uses as much as digits as its factorization.
4101211069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 4101211069 is about 64040.6985361653. The cubic root of 4101211069 is about 1600.6782370653.
The spelling of 4101211069 in words is "four billion, one hundred one million, two hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •