Base | Representation |
---|---|
bin | 100101001011100101100… |
… | …1100010011100011101111 |
3 | 200002112010101221122011112 |
4 | 1022113023030103203233 |
5 | 1132211014012200011 |
6 | 14511320431542235 |
7 | 1035123443541164 |
oct | 112271314234357 |
9 | 20075111848145 |
10 | 5110125115631 |
11 | 16a0212452918 |
12 | 6a646268a97b |
13 | 2b0b62489693 |
14 | 13948d41806b |
15 | 8cdd57d058b |
hex | 4a5cb3138ef |
5110125115631 has 8 divisors (see below), whose sum is σ = 5163848822160. Its totient is φ = 5056422674688.
The previous prime is 5110125115621. The next prime is 5110125115637. The reversal of 5110125115631 is 1365115210115.
It is a happy number.
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 5110125115631 - 218 = 5110124853487 is a prime.
It is a super-2 number, since 2×51101251156312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110125115637) 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, 4833041 + ... + 5794698.
It is an arithmetic number, because the mean of its divisors is an integer number (645481102770).
Almost surely, 25110125115631 is an apocalyptic number.
5110125115631 is a deficient number, since it is larger than the sum of its proper divisors (53723706529).
5110125115631 is a wasteful number, since it uses less digits than its factorization.
5110125115631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10632793.
The product of its (nonzero) digits is 4500, while the sum is 32.
The spelling of 5110125115631 in words is "five trillion, one hundred ten billion, one hundred twenty-five million, one hundred fifteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •