Base | Representation |
---|---|
bin | 111010001101011010111… |
… | …011000111111011110101 |
3 | 112011102001122010111012212 |
4 | 322031122323013323311 |
5 | 1011014241320013023 |
6 | 12301350002423205 |
7 | 562000124666252 |
oct | 72153273077365 |
9 | 15142048114185 |
10 | 4000140001013 |
11 | 13024a4824492 |
12 | 547306961b05 |
13 | 230299b06380 |
14 | db871b84429 |
15 | 6e0bd411e78 |
hex | 3a35aec7ef5 |
4000140001013 has 8 divisors (see below), whose sum is σ = 4326820363488. Its totient is φ = 3676170679344.
The previous prime is 4000140001007. The next prime is 4000140001057. The reversal of 4000140001013 is 3101000410004.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4000140001013 is a prime.
It is a super-2 number, since 2×40001400010132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4000140001313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677757131 + ... + 677763032.
It is an arithmetic number, because the mean of its divisors is an integer number (540852545436).
Almost surely, 24000140001013 is an apocalyptic number.
It is an amenable number.
4000140001013 is a deficient number, since it is larger than the sum of its proper divisors (326680362475).
4000140001013 is a wasteful number, since it uses less digits than its factorization.
4000140001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355520403.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 4000140001013 its reverse (3101000410004), we get a palindrome (7101140411017).
The spelling of 4000140001013 in words is "four trillion, one hundred forty million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •