Base | Representation |
---|---|
bin | 1001100001001101… |
… | …10101011100100011 |
3 | 111012011012222000222 |
4 | 10300212311130203 |
5 | 40431234012201 |
6 | 2203034433255 |
7 | 240433066643 |
oct | 46046653443 |
9 | 14164188028 |
10 | 5110454051 |
11 | 219279984a |
12 | ba759282b |
13 | 6359c2811 |
14 | 366a14523 |
15 | 1ed9c391b |
hex | 1309b5723 |
5110454051 has 4 divisors (see below), whose sum is σ = 5111318472. Its totient is φ = 5109589632.
The previous prime is 5110454017. The next prime is 5110454057. The reversal of 5110454051 is 1504540115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5110454051 - 210 = 5110453027 is a prime.
It is a super-2 number, since 2×51104540512 = 52233481214764621202, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5110454051.
It is not an unprimeable number, because it can be changed into a prime (5110454057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 423281 + ... + 435186.
It is an arithmetic number, because the mean of its divisors is an integer number (1277829618).
Almost surely, 25110454051 is an apocalyptic number.
5110454051 is a deficient number, since it is larger than the sum of its proper divisors (864421).
5110454051 is an equidigital number, since it uses as much as digits as its factorization.
5110454051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 864420.
The product of its (nonzero) digits is 2000, while the sum is 26.
The square root of 5110454051 is about 71487.4398128790. The cubic root of 5110454051 is about 1722.4759333595.
Adding to 5110454051 its reverse (1504540115), we get a palindrome (6614994166).
The spelling of 5110454051 in words is "five billion, one hundred ten million, four hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •