Base | Representation |
---|---|
bin | 10111101011010010110100… |
… | …11110011110101011111011 |
3 | 20211100101011010210002210212 |
4 | 23311221122132132223323 |
5 | 23311013322021022223 |
6 | 302422214303501335 |
7 | 13652402666515616 |
oct | 1365513236365373 |
9 | 224311133702725 |
10 | 52065111501563 |
11 | 15653765120796 |
12 | 5a0a6985b784b |
13 | 23089466b2a64 |
14 | cbdd7175517d |
15 | 6044edebe278 |
hex | 2f5a5a79eafb |
52065111501563 has 8 divisors (see below), whose sum is σ = 55142072939808. Its totient is φ = 48989739821184.
The previous prime is 52065111501553. The next prime is 52065111501593. The reversal of 52065111501563 is 36510511156025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52065111501563 - 26 = 52065111501499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52065111501563.
It is not an unprimeable number, because it can be changed into a prime (52065111501553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 397372031 + ... + 397503032.
It is an arithmetic number, because the mean of its divisors is an integer number (6892759117476).
Almost surely, 252065111501563 is an apocalyptic number.
52065111501563 is a deficient number, since it is larger than the sum of its proper divisors (3076961438245).
52065111501563 is a wasteful number, since it uses less digits than its factorization.
52065111501563 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 794878933.
The product of its (nonzero) digits is 135000, while the sum is 41.
Adding to 52065111501563 its reverse (36510511156025), we get a palindrome (88575622657588).
The spelling of 52065111501563 in words is "fifty-two trillion, sixty-five billion, one hundred eleven million, five hundred one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •