Base | Representation |
---|---|
bin | 11010001100100100110100… |
… | …010000111001100111101011 |
3 | 120002221021212011112200020102 |
4 | 122030210310100321213223 |
5 | 110100123442341420442 |
6 | 1045012143225420015 |
7 | 33160614553233341 |
oct | 3214446420714753 |
9 | 502837764480212 |
10 | 115213374560747 |
11 | 3378a799373341 |
12 | 10b0915a03a60b |
13 | 4c3976152ba58 |
14 | 20644ddb95991 |
15 | d4be6e646232 |
hex | 68c9344399eb |
115213374560747 has 2 divisors, whose sum is σ = 115213374560748. Its totient is φ = 115213374560746.
The previous prime is 115213374560729. The next prime is 115213374560783. The reversal of 115213374560747 is 747065473312511.
It is a weak prime.
It is an emirp because it is prime and its reverse (747065473312511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115213374560747 - 28 = 115213374560491 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115213374560692 and 115213374560701.
It is not a weakly prime, because it can be changed into another prime (115213374500747) by changing a digit.
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 as a sum of consecutive naturals, namely, 57606687280373 + 57606687280374.
It is an arithmetic number, because the mean of its divisors is an integer number (57606687280374).
Almost surely, 2115213374560747 is an apocalyptic number.
115213374560747 is a deficient number, since it is larger than the sum of its proper divisors (1).
115213374560747 is an equidigital number, since it uses as much as digits as its factorization.
115213374560747 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14817600, while the sum is 56.
The spelling of 115213374560747 in words is "one hundred fifteen trillion, two hundred thirteen billion, three hundred seventy-four million, five hundred sixty thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •