Base | Representation |
---|---|
bin | 100101100101101010001… |
… | …0110110100000111011111 |
3 | 200021212122022212012211002 |
4 | 1023023110112310013133 |
5 | 1134120200020041343 |
6 | 14553140232020515 |
7 | 1042145051464211 |
oct | 113132426640737 |
9 | 20255568765732 |
10 | 5166113440223 |
11 | 1711a333a185a |
12 | 6b5288b3173b |
13 | 2b6215a67b28 |
14 | 13c0811985b1 |
15 | 8e5b0c538b8 |
hex | 4b2d45b41df |
5166113440223 has 4 divisors (see below), whose sum is σ = 5167073511288. Its totient is φ = 5165153369160.
The previous prime is 5166113440219. The next prime is 5166113440253. The reversal of 5166113440223 is 3220443116615.
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 5166113440223 - 22 = 5166113440219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5166113440253) 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, 480027461 + ... + 480038222.
It is an arithmetic number, because the mean of its divisors is an integer number (1291768377822).
Almost surely, 25166113440223 is an apocalyptic number.
5166113440223 is a deficient number, since it is larger than the sum of its proper divisors (960071065).
5166113440223 is an equidigital number, since it uses as much as digits as its factorization.
5166113440223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960071064.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 5166113440223 its reverse (3220443116615), we get a palindrome (8386556556838).
The spelling of 5166113440223 in words is "five trillion, one hundred sixty-six billion, one hundred thirteen million, four hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •