Base | Representation |
---|---|
bin | 11010001110110011010111… |
… | …011001101101110100000101 |
3 | 120010110220221020112121101121 |
4 | 122032303113121231310011 |
5 | 110110130424431211003 |
6 | 1045210335254553541 |
7 | 33204643550065003 |
oct | 3216632731556405 |
9 | 503426836477347 |
10 | 115366435413253 |
11 | 338396a3215262 |
12 | 10b329559688b1 |
13 | 4c4b014c7a72b |
14 | 206ba9dc6da73 |
15 | d50e2bcd9cbd |
hex | 68ecd766dd05 |
115366435413253 has 2 divisors, whose sum is σ = 115366435413254. Its totient is φ = 115366435413252.
The previous prime is 115366435413227. The next prime is 115366435413311. The reversal of 115366435413253 is 352314534663511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64286511944769 + 51079923468484 = 8017887^2 + 7147022^2 .
It is a cyclic number.
It is not a de Polignac number, because 115366435413253 - 213 = 115366435405061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115366435413253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115366435483253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57683217706626 + 57683217706627.
It is an arithmetic number, because the mean of its divisors is an integer number (57683217706627).
Almost surely, 2115366435413253 is an apocalyptic number.
It is an amenable number.
115366435413253 is a deficient number, since it is larger than the sum of its proper divisors (1).
115366435413253 is an equidigital number, since it uses as much as digits as its factorization.
115366435413253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11664000, while the sum is 52.
The spelling of 115366435413253 in words is "one hundred fifteen trillion, three hundred sixty-six billion, four hundred thirty-five million, four hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •