Base | Representation |
---|---|
bin | 111011110101000000110… |
… | …000001010011111110111 |
3 | 112120001011110010110000211 |
4 | 323311000300022133313 |
5 | 1014330041214220012 |
6 | 12424423133050251 |
7 | 603015403661554 |
oct | 73650060123767 |
9 | 15501143113024 |
10 | 4111370070007 |
11 | 1345693248642 |
12 | 564989626987 |
13 | 23a9150c4c45 |
14 | 102dc4483a2b |
15 | 71e2d4d46a7 |
hex | 3bd40c0a7f7 |
4111370070007 has 4 divisors (see below), whose sum is σ = 4141380070656. Its totient is φ = 4081360069360.
The previous prime is 4111370070001. The next prime is 4111370070013. The reversal of 4111370070007 is 7000700731114.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (4111370070001) and next prime (4111370070013).
It is a cyclic number.
It is not a de Polignac number, because 4111370070007 - 227 = 4111235852279 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 (4111370070001) 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 3 ways as a sum of consecutive naturals, for example, 15005000119 + ... + 15005000392.
It is an arithmetic number, because the mean of its divisors is an integer number (1035345017664).
Almost surely, 24111370070007 is an apocalyptic number.
4111370070007 is a deficient number, since it is larger than the sum of its proper divisors (30010000649).
4111370070007 is a wasteful number, since it uses less digits than its factorization.
4111370070007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30010000648.
The product of its (nonzero) digits is 4116, while the sum is 31.
The spelling of 4111370070007 in words is "four trillion, one hundred eleven billion, three hundred seventy million, seventy thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •