Base | Representation |
---|---|
bin | 100100011101011111110… |
… | …1011000110001001000111 |
3 | 122202001122111022112021020 |
4 | 1020322333223012021013 |
5 | 1124100312242101433 |
6 | 14354031152322223 |
7 | 1025020623622626 |
oct | 110727753061107 |
9 | 18661574275236 |
10 | 5011147612743 |
11 | 1662241206a58 |
12 | 68b23b243373 |
13 | 2a471a76301c |
14 | 1347800bd6bd |
15 | 8a54121ccb3 |
hex | 48ebfac6247 |
5011147612743 has 16 divisors (see below), whose sum is σ = 7063902268800. Its totient is φ = 3151114647840.
The previous prime is 5011147612739. The next prime is 5011147612771. The reversal of 5011147612743 is 3472167411105.
It is a happy number.
It is not a de Polignac number, because 5011147612743 - 22 = 5011147612739 is a prime.
It is a super-2 number, since 2×50111476127432 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5011147612695 and 5011147612704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011147612043) 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 15 ways as a sum of consecutive naturals, for example, 191940813 + ... + 191966918.
It is an arithmetic number, because the mean of its divisors is an integer number (441493891800).
Almost surely, 25011147612743 is an apocalyptic number.
5011147612743 is a deficient number, since it is larger than the sum of its proper divisors (2052754656057).
5011147612743 is a wasteful number, since it uses less digits than its factorization.
5011147612743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383907982.
The product of its (nonzero) digits is 141120, while the sum is 42.
The spelling of 5011147612743 in words is "five trillion, eleven billion, one hundred forty-seven million, six hundred twelve thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •