Base | Representation |
---|---|
bin | 1111101001011010… |
… | …0100011001000111 |
3 | 101211201110021222021 |
4 | 3322112210121013 |
5 | 32100224021411 |
6 | 1532441144011 |
7 | 206041166014 |
oct | 37226443107 |
9 | 11751407867 |
10 | 4200220231 |
11 | 1865a07699 |
12 | 99278b007 |
13 | 51c25501c |
14 | 2bbb9270b |
15 | 198b24a71 |
hex | fa5a4647 |
4200220231 has 2 divisors, whose sum is σ = 4200220232. Its totient is φ = 4200220230.
The previous prime is 4200220181. The next prime is 4200220247. The reversal of 4200220231 is 1320220024.
It is an a-pointer prime, because the next prime (4200220247) can be obtained adding 4200220231 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4200220231 - 221 = 4198123079 is a prime.
It is a super-2 number, since 2×42002202312 = 35283699977803386722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4200220261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2100110115 + 2100110116.
It is an arithmetic number, because the mean of its divisors is an integer number (2100110116).
Almost surely, 24200220231 is an apocalyptic number.
4200220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
4200220231 is an equidigital number, since it uses as much as digits as its factorization.
4200220231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 4200220231 is about 64809.1060808587. The cubic root of 4200220231 is about 1613.4568460875.
Adding to 4200220231 its reverse (1320220024), we get a palindrome (5520440255).
The spelling of 4200220231 in words is "four billion, two hundred million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •