Base | Representation |
---|---|
bin | 100101010001100110100… |
… | …0110101101100010111011 |
3 | 200010202110121112201011212 |
4 | 1022203031012231202323 |
5 | 1132413442234334111 |
6 | 14521254255513335 |
7 | 1036061521254650 |
oct | 112431506554273 |
9 | 20122417481155 |
10 | 5123042105531 |
11 | 16a5740790589 |
12 | 6a8a6852884b |
13 | 2b21405b5b7c |
14 | 139d56b35c27 |
15 | 8d3de7d698b |
hex | 4a8cd1ad8bb |
5123042105531 has 8 divisors (see below), whose sum is σ = 5855098781664. Its totient is φ = 4391033808960.
The previous prime is 5123042105479. The next prime is 5123042105549. The reversal of 5123042105531 is 1355012403215.
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-5123042105531 is a prime.
It is a super-3 number, since 3×51230421055313 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5123042185531) 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, 11867690 + ... + 12291791.
It is an arithmetic number, because the mean of its divisors is an integer number (731887347708).
Almost surely, 25123042105531 is an apocalyptic number.
5123042105531 is a deficient number, since it is larger than the sum of its proper divisors (732056676133).
5123042105531 is a wasteful number, since it uses less digits than its factorization.
5123042105531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24189781.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 5123042105531 its reverse (1355012403215), we get a palindrome (6478054508746).
The spelling of 5123042105531 in words is "five trillion, one hundred twenty-three billion, forty-two million, one hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •