Base | Representation |
---|---|
bin | 100100011101010001110… |
… | …1010011011100011001001 |
3 | 122202000102202001021120022 |
4 | 1020322203222123203021 |
5 | 1124043331441114413 |
6 | 14353512404110225 |
7 | 1025003156340425 |
oct | 110724352334311 |
9 | 18660382037508 |
10 | 5010677676233 |
11 | 166201aa13779 |
12 | 68b129995375 |
13 | 2a46742a5a98 |
14 | 134737911b85 |
15 | 8a514d42608 |
hex | 48ea3a9b8c9 |
5010677676233 has 6 divisors (see below), whose sum is σ = 5062866697566. Its totient is φ = 4959021196032.
The previous prime is 5010677676227. The next prime is 5010677676239. The reversal of 5010677676233 is 3326767760105.
It is an interprime number because it is at equal distance from previous prime (5010677676227) and next prime (5010677676239).
It can be written as a sum of positive squares in 3 ways, for example, as 325301403904 + 4685376272329 = 570352^2 + 2164573^2 .
It is a de Polignac number, because none of the positive numbers 2k-5010677676233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5010677676239) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 266261060 + ... + 266279877.
It is an arithmetic number, because the mean of its divisors is an integer number (843811116261).
Almost surely, 25010677676233 is an apocalyptic number.
It is an amenable number.
5010677676233 is a deficient number, since it is larger than the sum of its proper divisors (52189021333).
5010677676233 is an frugal number, since it uses more digits than its factorization.
5010677676233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532541131 (or 532541034 counting only the distinct ones).
The product of its (nonzero) digits is 6667920, while the sum is 53.
The spelling of 5010677676233 in words is "five trillion, ten billion, six hundred seventy-seven million, six hundred seventy-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •