Base | Representation |
---|---|
bin | 11010101010011101… |
… | …101100101001100001 |
3 | 2201220020212020111022 |
4 | 122222131230221201 |
5 | 432113201344203 |
6 | 21052522055225 |
7 | 2032320365315 |
oct | 325235545141 |
9 | 81806766438 |
10 | 28629715553 |
11 | 1116180104a |
12 | 567004a515 |
13 | 291351bcba |
14 | 155846db45 |
15 | b286a3a38 |
hex | 6aa76ca61 |
28629715553 has 4 divisors (see below), whose sum is σ = 28630633668. Its totient is φ = 28628797440.
The previous prime is 28629715523. The next prime is 28629715561. The reversal of 28629715553 is 35551792682.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2971122064 + 25658593489 = 54508^2 + 160183^2 .
It is a cyclic number.
It is not a de Polignac number, because 28629715553 - 28 = 28629715297 is a prime.
It is a super-2 number, since 2×286297155532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 28629715495 and 28629715504.
It is not an unprimeable number, because it can be changed into a prime (28629715523) 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, 410576 + ... + 475217.
It is an arithmetic number, because the mean of its divisors is an integer number (7157658417).
Almost surely, 228629715553 is an apocalyptic number.
It is an amenable number.
28629715553 is a deficient number, since it is larger than the sum of its proper divisors (918115).
28629715553 is an equidigital number, since it uses as much as digits as its factorization.
28629715553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918114.
The product of its digits is 4536000, while the sum is 53.
The spelling of 28629715553 in words is "twenty-eight billion, six hundred twenty-nine million, seven hundred fifteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •