Base | Representation |
---|---|
bin | 11001001001010111… |
… | …00100111010011101 |
3 | 1021211212012112222021 |
4 | 30210223210322131 |
5 | 210122034230203 |
6 | 10111342220141 |
7 | 655356461644 |
oct | 144453447235 |
9 | 37755175867 |
10 | 13500305053 |
11 | 57a8630004 |
12 | 2749284651 |
13 | 1371c328b1 |
14 | 920da035b |
15 | 54032a5bd |
hex | 324ae4e9d |
13500305053 has 4 divisors (see below), whose sum is σ = 13829580828. Its totient is φ = 13171029280.
The previous prime is 13500305029. The next prime is 13500305059. The reversal of 13500305053 is 35050300531.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35050300531 = 2477 ⋅14150303.
It can be written as a sum of positive squares in 2 ways, for example, as 6218584164 + 7281720889 = 78858^2 + 85333^2 .
It is a cyclic number.
It is not a de Polignac number, because 13500305053 - 29 = 13500304541 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 (13500305059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 164637826 + ... + 164637907.
It is an arithmetic number, because the mean of its divisors is an integer number (3457395207).
Almost surely, 213500305053 is an apocalyptic number.
It is an amenable number.
13500305053 is a deficient number, since it is larger than the sum of its proper divisors (329275775).
13500305053 is an equidigital number, since it uses as much as digits as its factorization.
13500305053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329275774.
The product of its (nonzero) digits is 3375, while the sum is 25.
Adding to 13500305053 its reverse (35050300531), we get a palindrome (48550605584).
The spelling of 13500305053 in words is "thirteen billion, five hundred million, three hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •