Base | Representation |
---|---|
bin | 11001111111101110100110… |
… | …101100100100110110010001 |
3 | 112222210220002021220220022122 |
4 | 121333232212230210312101 |
5 | 104441142411433432340 |
6 | 1043054415415344025 |
7 | 33040052100141131 |
oct | 3177564654446621 |
9 | 488726067826278 |
10 | 114330531155345 |
11 | 3347a340278a4a |
12 | 109a6033682015 |
13 | 4ba442733378b |
14 | 20338ad1b2ac1 |
15 | d33eed424db5 |
hex | 67fba6b24d91 |
114330531155345 has 16 divisors (see below), whose sum is σ = 141932840602320. Its totient is φ = 88307190988800.
The previous prime is 114330531155251. The next prime is 114330531155359. The reversal of 114330531155345 is 543551135033411.
It can be written as a sum of positive squares in 8 ways, for example, as 1898630456464 + 112431900698881 = 1377908^2 + 10603391^2 .
It is not a de Polignac number, because 114330531155345 - 214 = 114330531138961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114330531155296 and 114330531155305.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10768496 + ... + 18563985.
It is an arithmetic number, because the mean of its divisors is an integer number (8870802537645).
Almost surely, 2114330531155345 is an apocalyptic number.
It is an amenable number.
114330531155345 is a deficient number, since it is larger than the sum of its proper divisors (27602309446975).
114330531155345 is a wasteful number, since it uses less digits than its factorization.
114330531155345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29359396.
The product of its (nonzero) digits is 810000, while the sum is 44.
Adding to 114330531155345 its reverse (543551135033411), we get a palindrome (657881666188756).
The spelling of 114330531155345 in words is "one hundred fourteen trillion, three hundred thirty billion, five hundred thirty-one million, one hundred fifty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •