Base | Representation |
---|---|
bin | 111100000000000010000… |
… | …100110001110000111001 |
3 | 112121011201010122110012111 |
4 | 330000002010301300321 |
5 | 1020023310033123001 |
6 | 12434101250412321 |
7 | 603614552503153 |
oct | 74000204616071 |
9 | 15534633573174 |
10 | 4123203411001 |
11 | 134a7059198a4 |
12 | 5671305910a1 |
13 | 23ba7c87706c |
14 | 1037c7cbbad3 |
15 | 723c22d4851 |
hex | 3c002131c39 |
4123203411001 has 8 divisors (see below), whose sum is σ = 4190883470408. Its totient is φ = 4055526144000.
The previous prime is 4123203410971. The next prime is 4123203411007. The reversal of 4123203411001 is 1001143023214.
It can be written as a sum of positive squares in 4 ways, for example, as 18851564601 + 4104351846400 = 137301^2 + 2025920^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4123203411001 - 27 = 4123203410873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4123203411007) 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, 2390521 + ... + 3736441.
It is an arithmetic number, because the mean of its divisors is an integer number (523860433801).
Almost surely, 24123203411001 is an apocalyptic number.
It is an amenable number.
4123203411001 is a deficient number, since it is larger than the sum of its proper divisors (67680059407).
4123203411001 is a wasteful number, since it uses less digits than its factorization.
4123203411001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1396203.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 4123203411001 its reverse (1001143023214), we get a palindrome (5124346434215).
The spelling of 4123203411001 in words is "four trillion, one hundred twenty-three billion, two hundred three million, four hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.039 sec. • engine limits •