Base | Representation |
---|---|
bin | 100110100101101001101… |
… | …0010100110011110110011 |
3 | 200210000100102211222012001 |
4 | 1031023103102212132303 |
5 | 1143343114313341201 |
6 | 15140224330314431 |
7 | 1055111346354406 |
oct | 115132322463663 |
9 | 20700312758161 |
10 | 5303534512051 |
11 | 1765241a72aa6 |
12 | 717a3ab88a17 |
13 | 2c6176254109 |
14 | 14499a0abd3d |
15 | 92e55358301 |
hex | 4d2d34a67b3 |
5303534512051 has 2 divisors, whose sum is σ = 5303534512052. Its totient is φ = 5303534512050.
The previous prime is 5303534512039. The next prime is 5303534512121. The reversal of 5303534512051 is 1502154353035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5303534512051 - 27 = 5303534511923 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5303534512051.
It is not a weakly prime, because it can be changed into another prime (5303534510051) 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, 2651767256025 + 2651767256026.
It is an arithmetic number, because the mean of its divisors is an integer number (2651767256026).
Almost surely, 25303534512051 is an apocalyptic number.
5303534512051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5303534512051 is an equidigital number, since it uses as much as digits as its factorization.
5303534512051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 5303534512051 its reverse (1502154353035), we get a palindrome (6805688865086).
The spelling of 5303534512051 in words is "five trillion, three hundred three billion, five hundred thirty-four million, five hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •