Base | Representation |
---|---|
bin | 11001001001010101… |
… | …00111000001000111 |
3 | 1021211211201200012102 |
4 | 30210222213001013 |
5 | 210122003122102 |
6 | 10111332542315 |
7 | 655354354544 |
oct | 144452470107 |
9 | 37754650172 |
10 | 13500051527 |
11 | 57a8477586 |
12 | 274918199b |
13 | 1371b74391 |
14 | 920d35bcb |
15 | 5402ca402 |
hex | 324aa7047 |
13500051527 has 2 divisors, whose sum is σ = 13500051528. Its totient is φ = 13500051526.
The previous prime is 13500051517. The next prime is 13500051529. The reversal of 13500051527 is 72515000531.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (72515000531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13500051527 - 24 = 13500051511 is a prime.
Together with 13500051529, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13500051527.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13500051529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6750025763 + 6750025764.
It is an arithmetic number, because the mean of its divisors is an integer number (6750025764).
Almost surely, 213500051527 is an apocalyptic number.
13500051527 is a deficient number, since it is larger than the sum of its proper divisors (1).
13500051527 is an equidigital number, since it uses as much as digits as its factorization.
13500051527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 29.
The spelling of 13500051527 in words is "thirteen billion, five hundred million, fifty-one thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •