Base | Representation |
---|---|
bin | 111010010001001111011… |
… | …111010010101110101001 |
3 | 112011210122120212200121001 |
4 | 322101033133102232221 |
5 | 1011101142214414423 |
6 | 12303305054515001 |
7 | 562203606650332 |
oct | 72211737225651 |
9 | 15153576780531 |
10 | 4004243123113 |
11 | 130420a941892 |
12 | 548070b05a61 |
13 | 2307a1bc267c |
14 | dbb40a9d289 |
15 | 6e25d756cad |
hex | 3a44f7d2ba9 |
4004243123113 has 4 divisors (see below), whose sum is σ = 4004273686468. Its totient is φ = 4004212559760.
The previous prime is 4004243123081. The next prime is 4004243123141. The reversal of 4004243123113 is 3113213424004.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2104510180249 + 1899732942864 = 1450693^2 + 1378308^2 .
It is a cyclic number.
It is not a de Polignac number, because 4004243123113 - 25 = 4004243123081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4004243123213) 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, 15084306 + ... + 15347467.
It is an arithmetic number, because the mean of its divisors is an integer number (1001068421617).
Almost surely, 24004243123113 is an apocalyptic number.
It is an amenable number.
4004243123113 is a deficient number, since it is larger than the sum of its proper divisors (30563355).
4004243123113 is a wasteful number, since it uses less digits than its factorization.
4004243123113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30563354.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 4004243123113 its reverse (3113213424004), we get a palindrome (7117456547117).
The spelling of 4004243123113 in words is "four trillion, four billion, two hundred forty-three million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •