Base | Representation |
---|---|
bin | 100100110001111100010… |
… | …0001011101011100111011 |
3 | 122220020222012101210012021 |
4 | 1021203320201131130323 |
5 | 1130310221032423201 |
6 | 14430131451455311 |
7 | 1031133610026325 |
oct | 111437041353473 |
9 | 18806865353167 |
10 | 5055051061051 |
11 | 16799205a2532 |
12 | 697852457537 |
13 | 2a88c642cbc4 |
14 | 136946c6a615 |
15 | 8b760756ea1 |
hex | 498f885d73b |
5055051061051 has 4 divisors (see below), whose sum is σ = 5101427676400. Its totient is φ = 5008674445704.
The previous prime is 5055051061031. The next prime is 5055051061061. The reversal of 5055051061051 is 1501601505505.
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 5055051061051 - 27 = 5055051060923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5055051060998 and 5055051061016.
It is not an unprimeable number, because it can be changed into a prime (5055051061031) 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 3 ways as a sum of consecutive naturals, for example, 23188307511 + ... + 23188307728.
It is an arithmetic number, because the mean of its divisors is an integer number (1275356919100).
Almost surely, 25055051061051 is an apocalyptic number.
5055051061051 is a deficient number, since it is larger than the sum of its proper divisors (46376615349).
5055051061051 is a wasteful number, since it uses less digits than its factorization.
5055051061051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46376615348.
The product of its (nonzero) digits is 18750, while the sum is 34.
Adding to 5055051061051 its reverse (1501601505505), we get a palindrome (6556652566556).
The spelling of 5055051061051 in words is "five trillion, fifty-five billion, fifty-one million, sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •