Base | Representation |
---|---|
bin | 1010100011000010010101… |
… | …0110010010110101001001 |
3 | 1112001122222112112210212011 |
4 | 2220300211112102311021 |
5 | 3010001213301103424 |
6 | 40355334510215521 |
7 | 2304600264045025 |
oct | 250604526226511 |
9 | 45048875483764 |
10 | 11597038300489 |
11 | 3771304871864 |
12 | 13737007b45a1 |
13 | 6617995ba135 |
14 | 2c142a343385 |
15 | 1519eb4eb694 |
hex | a8c25592d49 |
11597038300489 has 4 divisors (see below), whose sum is σ = 12101257357056. Its totient is φ = 11092819243924.
The previous prime is 11597038300487. The next prime is 11597038300493. The reversal of 11597038300489 is 98400383079511.
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 11597038300489 - 21 = 11597038300487 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11597038300487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252109528249 + ... + 252109528294.
It is an arithmetic number, because the mean of its divisors is an integer number (3025314339264).
Almost surely, 211597038300489 is an apocalyptic number.
It is an amenable number.
11597038300489 is a deficient number, since it is larger than the sum of its proper divisors (504219056567).
11597038300489 is an equidigital number, since it uses as much as digits as its factorization.
11597038300489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504219056566.
The product of its (nonzero) digits is 6531840, while the sum is 58.
The spelling of 11597038300489 in words is "eleven trillion, five hundred ninety-seven billion, thirty-eight million, three hundred thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •