Base | Representation |
---|---|
bin | 11010010001001100000000… |
… | …100110101000101101011001 |
3 | 120011001120222201022210102212 |
4 | 122101030000212220231121 |
5 | 110120322111332021241 |
6 | 1045413523045004505 |
7 | 33222535261143650 |
oct | 3221140046505531 |
9 | 504046881283385 |
10 | 115530335423321 |
11 | 338a215a527735 |
12 | 10b5a6776b3735 |
13 | 4c606051c9a00 |
14 | 20759ab70a197 |
15 | d55320d4abeb |
hex | 6913009a8b59 |
115530335423321 has 24 divisors (see below), whose sum is σ = 142973662797504. Its totient is φ = 91407843109440.
The previous prime is 115530335423281. The next prime is 115530335423357. The reversal of 115530335423321 is 123324533035511.
It is a de Polignac number, because none of the positive numbers 2k-115530335423321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (115530335423821) 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 in 23 ways as a sum of consecutive naturals, for example, 168539486 + ... + 169223576.
It is an arithmetic number, because the mean of its divisors is an integer number (5957235949896).
Almost surely, 2115530335423321 is an apocalyptic number.
It is an amenable number.
115530335423321 is a deficient number, since it is larger than the sum of its proper divisors (27443327374183).
115530335423321 is a wasteful number, since it uses less digits than its factorization.
115530335423321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826881 (or 826868 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 41.
Adding to 115530335423321 its reverse (123324533035511), we get a palindrome (238854868458832).
The spelling of 115530335423321 in words is "one hundred fifteen trillion, five hundred thirty billion, three hundred thirty-five million, four hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •