Base | Representation |
---|---|
bin | 111101001001001001000… |
… | …101111111110000001111 |
3 | 112212200022222222000120210 |
4 | 331021021011333300033 |
5 | 1022320042301332421 |
6 | 12534123013413503 |
7 | 612364102322100 |
oct | 75111105776017 |
9 | 15780288860523 |
10 | 4201704324111 |
11 | 137aa29609798 |
12 | 57a39a33a293 |
13 | 2462b02493c8 |
14 | 1075139103a7 |
15 | 74468d89576 |
hex | 3d24917fc0f |
4201704324111 has 48 divisors (see below), whose sum is σ = 6686669525760. Its totient is φ = 2338627294080.
The previous prime is 4201704324073. The next prime is 4201704324127. The reversal of 4201704324111 is 1114234071024.
It is not a de Polignac number, because 4201704324111 - 217 = 4201704193039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201704324161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3167590 + ... + 4293836.
It is an arithmetic number, because the mean of its divisors is an integer number (139305615120).
Almost surely, 24201704324111 is an apocalyptic number.
4201704324111 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4201704324111 is a deficient number, since it is larger than the sum of its proper divisors (2484965201649).
4201704324111 is a wasteful number, since it uses less digits than its factorization.
4201704324111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1126924 (or 1126917 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 30.
Adding to 4201704324111 its reverse (1114234071024), we get a palindrome (5315938395135).
The spelling of 4201704324111 in words is "four trillion, two hundred one billion, seven hundred four million, three hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •