Base | Representation |
---|---|
bin | 100101010001101100001… |
… | …1111110101110000011101 |
3 | 200010202221221012110022120 |
4 | 1022203120133311300131 |
5 | 1132414340202222031 |
6 | 14521325244333153 |
7 | 1036066332015360 |
oct | 112433037656035 |
9 | 20122857173276 |
10 | 5123233242141 |
11 | 16a582966a323 |
12 | 6a8b005441b9 |
13 | 2b2171088a61 |
14 | 139d7428c0d7 |
15 | 8d40148ea96 |
hex | 4a8d87f5c1d |
5123233242141 has 8 divisors (see below), whose sum is σ = 7806831607104. Its totient is φ = 2927561852640.
The previous prime is 5123233242133. The next prime is 5123233242181. The reversal of 5123233242141 is 1412423323215.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5123233242141 - 23 = 5123233242133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5123233242181) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 121981743840 + ... + 121981743881.
It is an arithmetic number, because the mean of its divisors is an integer number (975853950888).
Almost surely, 25123233242141 is an apocalyptic number.
It is an amenable number.
5123233242141 is a deficient number, since it is larger than the sum of its proper divisors (2683598364963).
5123233242141 is a wasteful number, since it uses less digits than its factorization.
5123233242141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243963487731.
The product of its digits is 34560, while the sum is 33.
Adding to 5123233242141 its reverse (1412423323215), we get a palindrome (6535656565356).
The spelling of 5123233242141 in words is "five trillion, one hundred twenty-three billion, two hundred thirty-three million, two hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •