Base | Representation |
---|---|
bin | 100101100100011101000… |
… | …1100100001100100100001 |
3 | 200021121222002010001120010 |
4 | 1023020322030201210201 |
5 | 1134044400411122203 |
6 | 14552031440435133 |
7 | 1042024004523363 |
oct | 113107214414441 |
9 | 20247862101503 |
10 | 5163527051553 |
11 | 1710926453762 |
12 | 6b4886918aa9 |
13 | 2b5bc2c7c430 |
14 | 13bcb789ad33 |
15 | 8e4adb61303 |
hex | 4b23a321921 |
5163527051553 has 8 divisors (see below), whose sum is σ = 7414295253568. Its totient is φ = 3177555108624.
The previous prime is 5163527051537. The next prime is 5163527051563. The reversal of 5163527051553 is 3551507253615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5163527051553 - 24 = 5163527051537 is a prime.
It is a super-2 number, since 2×51635270515532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5163527051563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66199064725 + ... + 66199064802.
It is an arithmetic number, because the mean of its divisors is an integer number (926786906696).
Almost surely, 25163527051553 is an apocalyptic number.
It is an amenable number.
5163527051553 is a deficient number, since it is larger than the sum of its proper divisors (2250768202015).
5163527051553 is a wasteful number, since it uses less digits than its factorization.
5163527051553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132398129543.
The product of its (nonzero) digits is 2362500, while the sum is 48.
The spelling of 5163527051553 in words is "five trillion, one hundred sixty-three billion, five hundred twenty-seven million, fifty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •