Base | Representation |
---|---|
bin | 11010000010111111111000… |
… | …100100010100010011010011 |
3 | 120000121101002211221110022221 |
4 | 122002333320210110103103 |
5 | 110003333114203142043 |
6 | 1043345541354441511 |
7 | 33062225466401203 |
oct | 3202777044242323 |
9 | 500541084843287 |
10 | 114555243021523 |
11 | 33556673266a47 |
12 | 10a216a7133297 |
13 | 4bbc689284475 |
14 | 2040709276403 |
15 | d39ca11038ed |
hex | 682ff89144d3 |
114555243021523 has 2 divisors, whose sum is σ = 114555243021524. Its totient is φ = 114555243021522.
The previous prime is 114555243021469. The next prime is 114555243021551. The reversal of 114555243021523 is 325120342555411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114555243021523 - 229 = 114554706150611 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114555243021523.
It is not a weakly prime, because it can be changed into another prime (114555243021623) 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, 57277621510761 + 57277621510762.
It is an arithmetic number, because the mean of its divisors is an integer number (57277621510762).
Almost surely, 2114555243021523 is an apocalyptic number.
114555243021523 is a deficient number, since it is larger than the sum of its proper divisors (1).
114555243021523 is an equidigital number, since it uses as much as digits as its factorization.
114555243021523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720000, while the sum is 43.
Adding to 114555243021523 its reverse (325120342555411), we get a palindrome (439675585576934).
The spelling of 114555243021523 in words is "one hundred fourteen trillion, five hundred fifty-five billion, two hundred forty-three million, twenty-one thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •