Base | Representation |
---|---|
bin | 11010001110001001010101… |
… | …010011011010101101100111 |
3 | 120010022121102220001001121101 |
4 | 122032021111103122231213 |
5 | 110103411012040113421 |
6 | 1045133513015500531 |
7 | 33201455252250163 |
oct | 3216112523325547 |
9 | 503277386031541 |
10 | 115321303051111 |
11 | 33821543174613 |
12 | 10b2605b087747 |
13 | 4c469a18048c1 |
14 | 206981bbc7ca3 |
15 | d4eb89953191 |
hex | 68e2554dab67 |
115321303051111 has 2 divisors, whose sum is σ = 115321303051112. Its totient is φ = 115321303051110.
The previous prime is 115321303051067. The next prime is 115321303051261. The reversal of 115321303051111 is 111150303123511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115321303051111 - 223 = 115321294662503 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115321303051111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115321303031111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57660651525555 + 57660651525556.
It is an arithmetic number, because the mean of its divisors is an integer number (57660651525556).
Almost surely, 2115321303051111 is an apocalyptic number.
115321303051111 is a deficient number, since it is larger than the sum of its proper divisors (1).
115321303051111 is an equidigital number, since it uses as much as digits as its factorization.
115321303051111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 28.
Adding to 115321303051111 its reverse (111150303123511), we get a palindrome (226471606174622).
The spelling of 115321303051111 in words is "one hundred fifteen trillion, three hundred twenty-one billion, three hundred three million, fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •