Base | Representation |
---|---|
bin | 100100101111110110010… |
… | …0100011101110011000101 |
3 | 122212211100220022102020122 |
4 | 1021133230210131303011 |
5 | 1130222014210230023 |
6 | 14424105421311325 |
7 | 1030614321613613 |
oct | 111375444356305 |
9 | 18784326272218 |
10 | 5050555555013 |
11 | 1677a23a41291 |
12 | 6969b8a05545 |
13 | 2a835ac6aa67 |
14 | 13663bbb06b3 |
15 | 8b59ac552c8 |
hex | 497ec91dcc5 |
5050555555013 has 2 divisors, whose sum is σ = 5050555555014. Its totient is φ = 5050555555012.
The previous prime is 5050555554973. The next prime is 5050555555099. The reversal of 5050555555013 is 3105555550505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4479415630369 + 571139924644 = 2116463^2 + 755738^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050555555013 - 218 = 5050555292869 is a prime.
It is a super-2 number, since 2×50505555550132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050555555313) 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 as a sum of consecutive naturals, namely, 2525277777506 + 2525277777507.
It is an arithmetic number, because the mean of its divisors is an integer number (2525277777507).
Almost surely, 25050555555013 is an apocalyptic number.
It is an amenable number.
5050555555013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050555555013 is an equidigital number, since it uses as much as digits as its factorization.
5050555555013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1171875, while the sum is 44.
The spelling of 5050555555013 in words is "five trillion, fifty billion, five hundred fifty-five million, five hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •