Base | Representation |
---|---|
bin | 111011111111111100100… |
… | …000011100110101101101 |
3 | 112121011110121212210011221 |
4 | 323333330200130311231 |
5 | 1020023112130031104 |
6 | 12434044112343341 |
7 | 603612336521614 |
oct | 73777440346555 |
9 | 15534417783157 |
10 | 4123110002029 |
11 | 134a66811a2a7 |
12 | 567105244b51 |
13 | 23ba66400595 |
14 | 1037b972487b |
15 | 723b8ed2c54 |
hex | 3bffc81cd6d |
4123110002029 has 4 divisors (see below), whose sum is σ = 4159597701276. Its totient is φ = 4086622302784.
The previous prime is 4123110002021. The next prime is 4123110002093. The reversal of 4123110002029 is 9202000113214.
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 593870596900 + 3529239405129 = 770630^2 + 1878627^2 .
It is a cyclic number.
It is not a de Polignac number, because 4123110002029 - 23 = 4123110002021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4123110001994 and 4123110002012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4123110002021) 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, 18243849454 + ... + 18243849679.
It is an arithmetic number, because the mean of its divisors is an integer number (1039899425319).
Almost surely, 24123110002029 is an apocalyptic number.
It is an amenable number.
4123110002029 is a deficient number, since it is larger than the sum of its proper divisors (36487699247).
4123110002029 is a wasteful number, since it uses less digits than its factorization.
4123110002029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36487699246.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 4123110002029 in words is "four trillion, one hundred twenty-three billion, one hundred ten million, two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •