Base | Representation |
---|---|
bin | 110101111100010100… |
… | …1111011100000111101 |
3 | 102002000011001222110012 |
4 | 1223320221323200331 |
5 | 3344220232002231 |
6 | 125114440153005 |
7 | 11240434220006 |
oct | 1537051734075 |
9 | 362004058405 |
10 | 115840890941 |
11 | 45145187a06 |
12 | 1a54aa68765 |
13 | ac016278a9 |
14 | 586cc161ad |
15 | 302eca1e2b |
hex | 1af8a7b83d |
115840890941 has 2 divisors, whose sum is σ = 115840890942. Its totient is φ = 115840890940.
The previous prime is 115840890883. The next prime is 115840891009. The reversal of 115840890941 is 149098048511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95267291716 + 20573599225 = 308654^2 + 143435^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115840890941 is a prime.
It is a super-2 number, since 2×1158408909412 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 115840890941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115840893941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57920445470 + 57920445471.
It is an arithmetic number, because the mean of its divisors is an integer number (57920445471).
Almost surely, 2115840890941 is an apocalyptic number.
It is an amenable number.
115840890941 is a deficient number, since it is larger than the sum of its proper divisors (1).
115840890941 is an equidigital number, since it uses as much as digits as its factorization.
115840890941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 414720, while the sum is 50.
The spelling of 115840890941 in words is "one hundred fifteen billion, eight hundred forty million, eight hundred ninety thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •