Base | Representation |
---|---|
bin | 1111000001000101… |
… | …1011110000111101 |
3 | 101101221020012101120 |
4 | 3300101123300331 |
5 | 31223430231023 |
6 | 1504000301153 |
7 | 201615542001 |
oct | 36021336075 |
9 | 11357205346 |
10 | 4031102013 |
11 | 17894a7674 |
12 | 9460117b9 |
13 | 4c31c1183 |
14 | 2a352c701 |
15 | 188d6a8e3 |
hex | f045bc3d |
4031102013 has 8 divisors (see below), whose sum is σ = 5409037728. Its totient is φ = 2670283824.
The previous prime is 4031102003. The next prime is 4031102021. The reversal of 4031102013 is 3102011304.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4031102013 - 217 = 4030970941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4031101983 and 4031102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4031102003) 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 in 7 ways as a sum of consecutive naturals, for example, 4278831 + ... + 4279772.
It is an arithmetic number, because the mean of its divisors is an integer number (676129716).
Almost surely, 24031102013 is an apocalyptic number.
It is an amenable number.
4031102013 is a deficient number, since it is larger than the sum of its proper divisors (1377935715).
4031102013 is a wasteful number, since it uses less digits than its factorization.
4031102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8558763.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 4031102013 is about 63490.9600888189. The cubic root of 4031102013 is about 1591.5047149396.
Adding to 4031102013 its reverse (3102011304), we get a palindrome (7133113317).
The spelling of 4031102013 in words is "four billion, thirty-one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.688 sec. • engine limits •