Base | Representation |
---|---|
bin | 110110000000000101… |
… | …1111011010100110001 |
3 | 102002022221211100200011 |
4 | 1230000023323110301 |
5 | 3400000103243234 |
6 | 125135152254521 |
7 | 11243530210012 |
oct | 1540013732461 |
9 | 362287740604 |
10 | 115967243569 |
11 | 451aa538571 |
12 | 1a585241441 |
13 | ac21867168 |
14 | 5881907009 |
15 | 303ae0eb64 |
hex | 1b002fb531 |
115967243569 has 4 divisors (see below), whose sum is σ = 115982798320. Its totient is φ = 115951688820.
The previous prime is 115967243531. The next prime is 115967243573. The reversal of 115967243569 is 965342769511.
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 115967243569 - 211 = 115967241521 is a prime.
It is a super-2 number, since 2×1159672435692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115967243269) 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, 7766187 + ... + 7781104.
It is an arithmetic number, because the mean of its divisors is an integer number (28995699580).
Almost surely, 2115967243569 is an apocalyptic number.
It is an amenable number.
115967243569 is a deficient number, since it is larger than the sum of its proper divisors (15554751).
115967243569 is an equidigital number, since it uses as much as digits as its factorization.
115967243569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15554750.
The product of its digits is 12247200, while the sum is 58.
The spelling of 115967243569 in words is "one hundred fifteen billion, nine hundred sixty-seven million, two hundred forty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •