Base | Representation |
---|---|
bin | 11010001011001000011110… |
… | …110010101001100100110101 |
3 | 120002120210221121200021012210 |
4 | 122023020132302221210311 |
5 | 110042012420343430430 |
6 | 1044454425223004033 |
7 | 33150504635005623 |
oct | 3213103662514465 |
9 | 502523847607183 |
10 | 115114230061365 |
11 | 33751741936547 |
12 | 10ab1aaa899619 |
13 | 4c302c10351c2 |
14 | 205d7b65ca513 |
15 | d495ba5982b0 |
hex | 68b21eca9935 |
115114230061365 has 16 divisors (see below), whose sum is σ = 184261445116416. Its totient is φ = 61368030360000.
The previous prime is 115114230061301. The next prime is 115114230061381. The reversal of 115114230061365 is 563160032411511.
It is not a de Polignac number, because 115114230061365 - 26 = 115114230061301 is a prime.
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 1639068261 + ... + 1639138490.
It is an arithmetic number, because the mean of its divisors is an integer number (11516340319776).
Almost surely, 2115114230061365 is an apocalyptic number.
115114230061365 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115114230061365 is a deficient number, since it is larger than the sum of its proper divisors (69147215055051).
115114230061365 is a wasteful number, since it uses less digits than its factorization.
115114230061365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3278209100.
The product of its (nonzero) digits is 64800, while the sum is 39.
Adding to 115114230061365 its reverse (563160032411511), we get a palindrome (678274262472876).
The spelling of 115114230061365 in words is "one hundred fifteen trillion, one hundred fourteen billion, two hundred thirty million, sixty-one thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •