Base | Representation |
---|---|
bin | 1100101101111011000011… |
… | …0111000101111001001101 |
3 | 1211111202210021211120122120 |
4 | 3023132300313011321031 |
5 | 3313044324424434212 |
6 | 45423424012403153 |
7 | 2642146621016325 |
oct | 313366067057115 |
9 | 54452707746576 |
10 | 13983085780557 |
11 | 4501214426233 |
12 | 169a0231764b9 |
13 | 7a57a396608a |
14 | 364adbd1c285 |
15 | 193aeb01c88c |
hex | cb7b0dc5e4d |
13983085780557 has 4 divisors (see below), whose sum is σ = 18644114374080. Its totient is φ = 9322057187036.
The previous prime is 13983085780549. The next prime is 13983085780597. The reversal of 13983085780557 is 75508758038931.
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 not a de Polignac number, because 13983085780557 - 23 = 13983085780549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13983085780491 and 13983085780500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13983085780597) 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, 2330514296757 + ... + 2330514296762.
It is an arithmetic number, because the mean of its divisors is an integer number (4661028593520).
Almost surely, 213983085780557 is an apocalyptic number.
It is an amenable number.
13983085780557 is a deficient number, since it is larger than the sum of its proper divisors (4661028593523).
13983085780557 is an equidigital number, since it uses as much as digits as its factorization.
13983085780557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4661028593522.
The product of its (nonzero) digits is 254016000, while the sum is 69.
The spelling of 13983085780557 in words is "thirteen trillion, nine hundred eighty-three billion, eighty-five million, seven hundred eighty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •