Base | Representation |
---|---|
bin | 111001011011111100… |
… | …1111110110000011001 |
3 | 102210101002110112022001 |
4 | 1302313321332300121 |
5 | 4010102143422243 |
6 | 132355205001001 |
7 | 11624410033204 |
oct | 1626771766031 |
9 | 383332415261 |
10 | 123344514073 |
11 | 48345843040 |
12 | 1baa39b3161 |
13 | b829083a91 |
14 | 5d815cc93b |
15 | 331d8eca4d |
hex | 1cb7e7ec19 |
123344514073 has 4 divisors (see below), whose sum is σ = 134557651728. Its totient is φ = 112131376420.
The previous prime is 123344514049. The next prime is 123344514079. The reversal of 123344514073 is 370415443321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 123344514073 - 233 = 114754579481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123344514079) 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 in 3 ways as a sum of consecutive naturals, for example, 5606568811 + ... + 5606568832.
It is an arithmetic number, because the mean of its divisors is an integer number (33639412932).
Almost surely, 2123344514073 is an apocalyptic number.
It is an amenable number.
123344514073 is a deficient number, since it is larger than the sum of its proper divisors (11213137655).
123344514073 is a wasteful number, since it uses less digits than its factorization.
123344514073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11213137654.
The product of its (nonzero) digits is 120960, while the sum is 37.
Adding to 123344514073 its reverse (370415443321), we get a palindrome (493759957394).
The spelling of 123344514073 in words is "one hundred twenty-three billion, three hundred forty-four million, five hundred fourteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •