Base | Representation |
---|---|
bin | 110101101101011111… |
… | …1100101001110101001 |
3 | 102000201110200012220000 |
4 | 1223122333211032221 |
5 | 3342210333002340 |
6 | 124553222053213 |
7 | 11222212310541 |
oct | 1533277451651 |
9 | 360643605800 |
10 | 115343250345 |
11 | 44a0a292194 |
12 | 1a43027a209 |
13 | ab524ba6bb |
14 | 5822ab6321 |
15 | 3001252d30 |
hex | 1adafe53a9 |
115343250345 has 60 divisors (see below), whose sum is σ = 209289658116. Its totient is φ = 60773768640.
The previous prime is 115343250299. The next prime is 115343250359. The reversal of 115343250345 is 543052343511.
115343250345 is a `hidden beast` number, since 1 + 1 + 534 + 32 + 50 + 3 + 45 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 30034276416 + 85308973929 = 173304^2 + 292077^2 .
It is not a de Polignac number, because 115343250345 - 28 = 115343250089 is a prime.
It is a Curzon number.
It is an unprimeable number.
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 59 ways as a sum of consecutive naturals, for example, 2769375 + ... + 2810715.
Almost surely, 2115343250345 is an apocalyptic number.
115343250345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115343250345 is a deficient number, since it is larger than the sum of its proper divisors (93946407771).
115343250345 is an frugal number, since it uses more digits than its factorization.
115343250345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41524 (or 41432 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 115343250345 its reverse (543052343511), we get a palindrome (658395593856).
The spelling of 115343250345 in words is "one hundred fifteen billion, three hundred forty-three million, two hundred fifty thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •