Base | Representation |
---|---|
bin | 11000111010110001… |
… | …11011111000000001 |
3 | 1021112100000200121101 |
4 | 30131120323320001 |
5 | 204344230242412 |
6 | 10051252254401 |
7 | 652342635616 |
oct | 143530737001 |
9 | 37470020541 |
10 | 13377977857 |
11 | 5745579852 |
12 | 2714311401 |
13 | 13527a263a |
14 | 90ca3a50d |
15 | 534715457 |
hex | 31d63be01 |
13377977857 has 4 divisors (see below), whose sum is σ = 13389249456. Its totient is φ = 13366706260.
The previous prime is 13377977831. The next prime is 13377977887. The reversal of 13377977857 is 75877977331.
13377977857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13377977857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13377977887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5634019 + ... + 5636392.
It is an arithmetic number, because the mean of its divisors is an integer number (3347312364).
Almost surely, 213377977857 is an apocalyptic number.
It is an amenable number.
13377977857 is a deficient number, since it is larger than the sum of its proper divisors (11271599).
13377977857 is a wasteful number, since it uses less digits than its factorization.
13377977857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11271598.
The product of its digits is 54454680, while the sum is 64.
The spelling of 13377977857 in words is "thirteen billion, three hundred seventy-seven million, nine hundred seventy-seven thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •