Base | Representation |
---|---|
bin | 110101001111010101… |
… | …1011001100001100001 |
3 | 101221002221120011102100 |
4 | 1222132223121201201 |
5 | 3333122304422221 |
6 | 124304553041013 |
7 | 11155144145454 |
oct | 1523653314141 |
9 | 357087504370 |
10 | 114331326561 |
11 | 44540064941 |
12 | 1a1a93b6169 |
13 | aa2096712a |
14 | 576854349b |
15 | 2e924b8926 |
hex | 1a9ead9861 |
114331326561 has 12 divisors (see below), whose sum is σ = 169608635092. Its totient is φ = 74160860256.
The previous prime is 114331326539. The next prime is 114331326569. The reversal of 114331326561 is 165623133411.
114331326561 is a `hidden beast` number, since 1 + 1 + 4 + 331 + 3 + 265 + 61 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 66695645025 + 47635681536 = 258255^2 + 218256^2 .
It is not a de Polignac number, because 114331326561 - 27 = 114331326433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114331326569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 171668326 + ... + 171668991.
Almost surely, 2114331326561 is an apocalyptic number.
It is an amenable number.
114331326561 is a deficient number, since it is larger than the sum of its proper divisors (55277308531).
114331326561 is a wasteful number, since it uses less digits than its factorization.
114331326561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343337360 (or 343337357 counting only the distinct ones).
The product of its digits is 38880, while the sum is 36.
Adding to 114331326561 its reverse (165623133411), we get a palindrome (279954459972).
The spelling of 114331326561 in words is "one hundred fourteen billion, three hundred thirty-one million, three hundred twenty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •