Base | Representation |
---|---|
bin | 100101001011100101011… |
… | …1011001100110010011011 |
3 | 200002112010002111211000210 |
4 | 1022113022323030302123 |
5 | 1132211011340201301 |
6 | 14511320151502203 |
7 | 1035123360453603 |
oct | 112271273146233 |
9 | 20075102454023 |
10 | 5110120631451 |
11 | 16a020a96a890 |
12 | 6a6461087963 |
13 | 2b0b61579614 |
14 | 13948c9abc03 |
15 | 8cdd51e6ad6 |
hex | 4a5caeccc9b |
5110120631451 has 16 divisors (see below), whose sum is σ = 7473968506368. Its totient is φ = 3079932069600.
The previous prime is 5110120631443. The next prime is 5110120631467. The reversal of 5110120631451 is 1541360210115.
It is not a de Polignac number, because 5110120631451 - 23 = 5110120631443 is a prime.
It is a super-2 number, since 2×51101206314512 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5110120631851) 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, 427762371 + ... + 427774316.
It is an arithmetic number, because the mean of its divisors is an integer number (467123031648).
Almost surely, 25110120631451 is an apocalyptic number.
5110120631451 is a deficient number, since it is larger than the sum of its proper divisors (2363847874917).
5110120631451 is a wasteful number, since it uses less digits than its factorization.
5110120631451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855536882.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 5110120631451 its reverse (1541360210115), we get a palindrome (6651480841566).
The spelling of 5110120631451 in words is "five trillion, one hundred ten billion, one hundred twenty million, six hundred thirty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •