Base | Representation |
---|---|
bin | 111101001000110010001… |
… | …101011100010011101111 |
3 | 112212122100020112122212101 |
4 | 331020302031130103233 |
5 | 1022313301010300421 |
6 | 12534020540515531 |
7 | 612351431114122 |
oct | 75106215342357 |
9 | 15778306478771 |
10 | 4201320400111 |
11 | 137a851923a2a |
12 | 57a2b184bba7 |
13 | 24624b846143 |
14 | 1074b89323b9 |
15 | 744452ee191 |
hex | 3d23235c4ef |
4201320400111 has 16 divisors (see below), whose sum is σ = 4454914544640. Its totient is φ = 3956667160320.
The previous prime is 4201320400103. The next prime is 4201320400117. The reversal of 4201320400111 is 1110040231024.
It is a cyclic number.
It is not a de Polignac number, because 4201320400111 - 23 = 4201320400103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201320400117) 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 15 ways as a sum of consecutive naturals, for example, 10710856 + ... + 11096173.
It is an arithmetic number, because the mean of its divisors is an integer number (278432159040).
Almost surely, 24201320400111 is an apocalyptic number.
4201320400111 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4201320400111 is a deficient number, since it is larger than the sum of its proper divisors (253594144529).
4201320400111 is a wasteful number, since it uses less digits than its factorization.
4201320400111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21807234.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 4201320400111 its reverse (1110040231024), we get a palindrome (5311360631135).
The spelling of 4201320400111 in words is "four trillion, two hundred one billion, three hundred twenty million, four hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •