Base | Representation |
---|---|
bin | 11000010100001001… |
… | …11100000111001101 |
3 | 1020200202100022210121 |
4 | 30022010330013031 |
5 | 203213304000340 |
6 | 5555155504541 |
7 | 641326622131 |
oct | 141204740715 |
9 | 36622308717 |
10 | 13053968845 |
11 | 5599697005 |
12 | 26438b8151 |
13 | 1300619728 |
14 | 8bb9b73c1 |
15 | 51606294a |
hex | 30a13c1cd |
13053968845 has 4 divisors (see below), whose sum is σ = 15664762620. Its totient is φ = 10443175072.
The previous prime is 13053968801. The next prime is 13053968869. The reversal of 13053968845 is 54886935031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54886935031 = 229 ⋅239680939.
It can be written as a sum of positive squares in 2 ways, for example, as 2127238884 + 10926729961 = 46122^2 + 104531^2 .
It is a cyclic number.
It is not a de Polignac number, because 13053968845 - 27 = 13053968717 is a prime.
It is a super-2 number, since 2×130539688452 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13053968792 and 13053968801.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1305396880 + ... + 1305396889.
It is an arithmetic number, because the mean of its divisors is an integer number (3916190655).
Almost surely, 213053968845 is an apocalyptic number.
It is an amenable number.
13053968845 is a deficient number, since it is larger than the sum of its proper divisors (2610793775).
13053968845 is an equidigital number, since it uses as much as digits as its factorization.
13053968845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2610793774.
The product of its (nonzero) digits is 3110400, while the sum is 52.
The spelling of 13053968845 in words is "thirteen billion, fifty-three million, nine hundred sixty-eight thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •