Base | Representation |
---|---|
bin | 100100110010000000110… |
… | …0010000001111010100001 |
3 | 122220021100201210201012002 |
4 | 1021210001202001322201 |
5 | 1130311023231032340 |
6 | 14430154451213345 |
7 | 1031140423523255 |
oct | 111440142017241 |
9 | 18807321721162 |
10 | 5055202205345 |
11 | 1679998946476 |
12 | 697894ba7255 |
13 | 2a891b83c8b6 |
14 | 13695cd72265 |
15 | 8b76db60715 |
hex | 49901881ea1 |
5055202205345 has 8 divisors (see below), whose sum is σ = 6066553836840. Its totient is φ = 4043954304000.
The previous prime is 5055202205327. The next prime is 5055202205363. The reversal of 5055202205345 is 5435022025505.
It is an interprime number because it is at equal distance from previous prime (5055202205327) and next prime (5055202205363).
It can be written as a sum of positive squares in 4 ways, for example, as 27064198144 + 5028138007201 = 164512^2 + 2242351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5055202205345 - 26 = 5055202205281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5055202205299 and 5055202205308.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25825280 + ... + 26020289.
It is an arithmetic number, because the mean of its divisors is an integer number (758319229605).
Almost surely, 25055202205345 is an apocalyptic number.
It is an amenable number.
5055202205345 is a deficient number, since it is larger than the sum of its proper divisors (1011351631495).
5055202205345 is a wasteful number, since it uses less digits than its factorization.
5055202205345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51865075.
The product of its (nonzero) digits is 300000, while the sum is 38.
The spelling of 5055202205345 in words is "five trillion, fifty-five billion, two hundred two million, two hundred five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •