Base | Representation |
---|---|
bin | 11001011100001000… |
… | …11000000101100001 |
3 | 1022020211120011212121 |
4 | 30232010120011201 |
5 | 210432344113212 |
6 | 10135130024241 |
7 | 662311251655 |
oct | 145604300541 |
9 | 38224504777 |
10 | 13657801057 |
11 | 587952209a |
12 | 2791b78081 |
13 | 13987576b4 |
14 | 937c7aa65 |
15 | 54e08ad07 |
hex | 32e118161 |
13657801057 has 4 divisors (see below), whose sum is σ = 13707107476. Its totient is φ = 13608494640.
The previous prime is 13657801033. The next prime is 13657801061. The reversal of 13657801057 is 75010875631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75010875631 = 37 ⋅2027320963.
It can be written as a sum of positive squares in 2 ways, for example, as 1301477776 + 12356323281 = 36076^2 + 111159^2 .
It is a cyclic number.
It is not a de Polignac number, because 13657801057 - 223 = 13649412449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13657801357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24652794 + ... + 24653347.
It is an arithmetic number, because the mean of its divisors is an integer number (3426776869).
Almost surely, 213657801057 is an apocalyptic number.
It is an amenable number.
13657801057 is a deficient number, since it is larger than the sum of its proper divisors (49306419).
13657801057 is an equidigital number, since it uses as much as digits as its factorization.
13657801057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49306418.
The product of its (nonzero) digits is 176400, while the sum is 43.
The spelling of 13657801057 in words is "thirteen billion, six hundred fifty-seven million, eight hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •