Base | Representation |
---|---|
bin | 11001111111111011101000… |
… | …001010000010110110100001 |
3 | 112222212020011210200022112221 |
4 | 121333323220022002312201 |
5 | 104441410031130120340 |
6 | 1043105051130551041 |
7 | 33041055442002466 |
oct | 3177735012026641 |
9 | 488766153608487 |
10 | 114344514301345 |
11 | 33485266405559 |
12 | 109a8896598481 |
13 | 4ba58452c1173 |
14 | 203443833d66d |
15 | d3456ad2944a |
hex | 67fee8282da1 |
114344514301345 has 16 divisors (see below), whose sum is σ = 137659442464080. Its totient is φ = 91178293699584.
The previous prime is 114344514301319. The next prime is 114344514301349. The reversal of 114344514301345 is 543103415443411.
It can be written as a sum of positive squares in 8 ways, for example, as 16875039589776 + 97469474711569 = 4107924^2 + 9872663^2 .
It is a cyclic number.
It is not a de Polignac number, because 114344514301345 - 235 = 114310154562977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114344514301349) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26289727 + ... + 30328843.
It is an arithmetic number, because the mean of its divisors is an integer number (8603715154005).
Almost surely, 2114344514301345 is an apocalyptic number.
It is an amenable number.
114344514301345 is a deficient number, since it is larger than the sum of its proper divisors (23314928162735).
114344514301345 is a wasteful number, since it uses less digits than its factorization.
114344514301345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4057524.
The product of its (nonzero) digits is 691200, while the sum is 43.
Adding to 114344514301345 its reverse (543103415443411), we get a palindrome (657447929744756).
The spelling of 114344514301345 in words is "one hundred fourteen trillion, three hundred forty-four billion, five hundred fourteen million, three hundred one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •