Base | Representation |
---|---|
bin | 111010011001110010100… |
… | …110010110110101110010 |
3 | 112012200100021202122100122 |
4 | 322121302212112311302 |
5 | 1011223442030041424 |
6 | 12311423552250242 |
7 | 562650225036242 |
oct | 72316246266562 |
9 | 15180307678318 |
10 | 4013422112114 |
11 | 13080a0175108 |
12 | 5499b2b40982 |
13 | 2316057815cc |
14 | dc371b87b22 |
15 | 6e5e94dc45e |
hex | 3a672996d72 |
4013422112114 has 8 divisors (see below), whose sum is σ = 6024019637100. Its totient is φ = 2005415566416.
The previous prime is 4013422112099. The next prime is 4013422112129. The reversal of 4013422112114 is 4112112243104.
It is an interprime number because it is at equal distance from previous prime (4013422112099) and next prime (4013422112129).
It can be written as a sum of positive squares in 2 ways, for example, as 3908857188889 + 104564923225 = 1977083^2 + 323365^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×40134221121142 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 647740949 + ... + 647747144.
Almost surely, 24013422112114 is an apocalyptic number.
4013422112114 is a deficient number, since it is larger than the sum of its proper divisors (2010597524986).
4013422112114 is a wasteful number, since it uses less digits than its factorization.
4013422112114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295489644.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 4013422112114 its reverse (4112112243104), we get a palindrome (8125534355218).
The spelling of 4013422112114 in words is "four trillion, thirteen billion, four hundred twenty-two million, one hundred twelve thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •