Base | Representation |
---|---|
bin | 110101110110001101… |
… | …0111101110011011001 |
3 | 102001110211212020020022 |
4 | 1223230122331303121 |
5 | 3343310211012221 |
6 | 125042225040225 |
7 | 11232362510216 |
oct | 1535432756331 |
9 | 361424766208 |
10 | 115635641561 |
11 | 4504a33a020 |
12 | 1a4b2186075 |
13 | ab9ac5315b |
14 | 584d868b0d |
15 | 301bc5c4ab |
hex | 1aec6bdcd9 |
115635641561 has 4 divisors (see below), whose sum is σ = 126147972624. Its totient is φ = 105123310500.
The previous prime is 115635641557. The next prime is 115635641573. The reversal of 115635641561 is 165146536511.
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 115635641561 - 22 = 115635641557 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115631641561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5256165515 + ... + 5256165536.
It is an arithmetic number, because the mean of its divisors is an integer number (31536993156).
Almost surely, 2115635641561 is an apocalyptic number.
115635641561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
115635641561 is a deficient number, since it is larger than the sum of its proper divisors (10512331063).
115635641561 is a wasteful number, since it uses less digits than its factorization.
115635641561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10512331062.
The product of its digits is 324000, while the sum is 44.
The spelling of 115635641561 in words is "one hundred fifteen billion, six hundred thirty-five million, six hundred forty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •