Base | Representation |
---|---|
bin | 100100100011001101010… |
… | …0110000011000100000111 |
3 | 122210020022002222102000211 |
4 | 1021012122212003010013 |
5 | 1124300421032344221 |
6 | 14403420051220251 |
7 | 1025633536112203 |
oct | 111063246030407 |
9 | 18706262872024 |
10 | 5023410434311 |
11 | 1667464259335 |
12 | 6916a1ba7687 |
13 | 2a59231a9169 |
14 | 1351c4993b03 |
15 | 8aa0caa66e1 |
hex | 4919a983107 |
5023410434311 has 16 divisors (see below), whose sum is σ = 5364429431040. Its totient is φ = 4693587575040.
The previous prime is 5023410434303. The next prime is 5023410434351. The reversal of 5023410434311 is 1134340143205.
It is a cyclic number.
It is not a de Polignac number, because 5023410434311 - 23 = 5023410434303 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5023410434351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39237675 + ... + 39365491.
It is an arithmetic number, because the mean of its divisors is an integer number (335276839440).
Almost surely, 25023410434311 is an apocalyptic number.
5023410434311 is a deficient number, since it is larger than the sum of its proper divisors (341018996729).
5023410434311 is a wasteful number, since it uses less digits than its factorization.
5023410434311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171594.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 5023410434311 its reverse (1134340143205), we get a palindrome (6157750577516).
The spelling of 5023410434311 in words is "five trillion, twenty-three billion, four hundred ten million, four hundred thirty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •