Base | Representation |
---|---|
bin | 1111101001101000… |
… | …0000000100011111 |
3 | 101211210011000021012 |
4 | 3322122000010133 |
5 | 32100441320111 |
6 | 1532512325435 |
7 | 206051634233 |
oct | 37232000437 |
9 | 11753130235 |
10 | 4201120031 |
11 | 1866471729 |
12 | 992b4387b |
13 | 51c4ab754 |
14 | 2bbd485c3 |
15 | 198c5148b |
hex | fa68011f |
4201120031 has 4 divisors (see below), whose sum is σ = 4336640064. Its totient is φ = 4065600000.
The previous prime is 4201120013. The next prime is 4201120057. The reversal of 4201120031 is 1300211024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4201120031 - 210 = 4201119007 is a prime.
It is a super-2 number, since 2×42011200312 = 35298819029738881922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4201119988 and 4201120015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201120331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67759970 + ... + 67760031.
It is an arithmetic number, because the mean of its divisors is an integer number (1084160016).
Almost surely, 24201120031 is an apocalyptic number.
4201120031 is a deficient number, since it is larger than the sum of its proper divisors (135520033).
4201120031 is a wasteful number, since it uses less digits than its factorization.
4201120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135520032.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 4201120031 is about 64816.0476348257. The cubic root of 4201120031 is about 1613.5720531268.
Adding to 4201120031 its reverse (1300211024), we get a palindrome (5501331055).
The spelling of 4201120031 in words is "four billion, two hundred one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •