Base | Representation |
---|---|
bin | 110101100111110000… |
… | …0111000011001010011 |
3 | 102000020001021021000102 |
4 | 1223033200320121103 |
5 | 3341312031344021 |
6 | 124522142043015 |
7 | 11214353254352 |
oct | 1531740703123 |
9 | 360201237012 |
10 | 115150653011 |
11 | 449205a5a39 |
12 | 1a39787946b |
13 | ab21625994 |
14 | 580529d999 |
15 | 2ede3ac00b |
hex | 1acf838653 |
115150653011 has 2 divisors, whose sum is σ = 115150653012. Its totient is φ = 115150653010.
The previous prime is 115150652999. The next prime is 115150653029. The reversal of 115150653011 is 110356051511.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115150653011 is a prime.
It is a super-2 number, since 2×1151506530112 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (115150653071) 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 as a sum of consecutive naturals, namely, 57575326505 + 57575326506.
It is an arithmetic number, because the mean of its divisors is an integer number (57575326506).
Almost surely, 2115150653011 is an apocalyptic number.
115150653011 is a deficient number, since it is larger than the sum of its proper divisors (1).
115150653011 is an equidigital number, since it uses as much as digits as its factorization.
115150653011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 29.
The spelling of 115150653011 in words is "one hundred fifteen billion, one hundred fifty million, six hundred fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •