Base | Representation |
---|---|
bin | 110010000010010000000110… |
… | …1110010001111111101111011 |
3 | 2010201022111110202011102101201 |
4 | 1210010200031302033331323 |
5 | 430141312204212011443 |
6 | 4200013345135355031 |
7 | 161463124115200105 |
oct | 14404401562177573 |
9 | 2121274422142351 |
10 | 440114120032123 |
11 | 1182633940089a9 |
12 | 41441094382a77 |
13 | 15b76777a6c534 |
14 | 7a978cc184575 |
15 | 35d35a19c834d |
hex | 190480dc8ff7b |
440114120032123 has 2 divisors, whose sum is σ = 440114120032124. Its totient is φ = 440114120032122.
The previous prime is 440114120032121. The next prime is 440114120032141. The reversal of 440114120032123 is 321230021411044.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 440114120032123 - 21 = 440114120032121 is a prime.
Together with 440114120032121, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 440114120032091 and 440114120032100.
It is not a weakly prime, because it can be changed into another prime (440114120032121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220057060016061 + 220057060016062.
It is an arithmetic number, because the mean of its divisors is an integer number (220057060016062).
Almost surely, 2440114120032123 is an apocalyptic number.
440114120032123 is a deficient number, since it is larger than the sum of its proper divisors (1).
440114120032123 is an equidigital number, since it uses as much as digits as its factorization.
440114120032123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 440114120032123 its reverse (321230021411044), we get a palindrome (761344141443167).
The spelling of 440114120032123 in words is "four hundred forty trillion, one hundred fourteen billion, one hundred twenty million, thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •