Base | Representation |
---|---|
bin | 11010001100100010000110… |
… | …010001001100001101111101 |
3 | 120002221000022201122000100101 |
4 | 122030202012101030031331 |
5 | 110100102003040320331 |
6 | 1045010541430001101 |
7 | 33160452325624456 |
oct | 3214420621141575 |
9 | 502830281560311 |
10 | 115210455401341 |
11 | 337895305a8703 |
12 | 10b086844a6191 |
13 | 4c393b78103b1 |
14 | 20643041d412d |
15 | d4bd4d220061 |
hex | 68c88644c37d |
115210455401341 has 2 divisors, whose sum is σ = 115210455401342. Its totient is φ = 115210455401340.
The previous prime is 115210455401219. The next prime is 115210455401387. The reversal of 115210455401341 is 143104554012511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105190356375225 + 10020099026116 = 10256235^2 + 3165454^2 .
It is a cyclic number.
It is not a de Polignac number, because 115210455401341 - 215 = 115210455368573 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115210455401341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115210453401341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57605227700670 + 57605227700671.
It is an arithmetic number, because the mean of its divisors is an integer number (57605227700671).
Almost surely, 2115210455401341 is an apocalyptic number.
It is an amenable number.
115210455401341 is a deficient number, since it is larger than the sum of its proper divisors (1).
115210455401341 is an equidigital number, since it uses as much as digits as its factorization.
115210455401341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 37.
The spelling of 115210455401341 in words is "one hundred fifteen trillion, two hundred ten billion, four hundred fifty-five million, four hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •