Base | Representation |
---|---|
bin | 111001011011111100… |
… | …1010100101111111011 |
3 | 102210101002010210021101 |
4 | 1302313321110233323 |
5 | 4010102122421021 |
6 | 132355201152231 |
7 | 11624405415442 |
oct | 1626771245773 |
9 | 383332123241 |
10 | 123344342011 |
11 | 48345735840 |
12 | 1baa392b677 |
13 | b829023677 |
14 | 5d81585d59 |
15 | 331d8b6a91 |
hex | 1cb7e54bfb |
123344342011 has 16 divisors (see below), whose sum is σ = 134801146368. Its totient is φ = 111928327200.
The previous prime is 123344342003. The next prime is 123344342021. The reversal of 123344342011 is 110243443321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 123344342011 - 23 = 123344342003 is a prime.
It is a super-3 number, since 3×1233443420113 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123344342021) 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, 22683385 + ... + 22688821.
It is an arithmetic number, because the mean of its divisors is an integer number (8425071648).
Almost surely, 2123344342011 is an apocalyptic number.
123344342011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123344342011 is a deficient number, since it is larger than the sum of its proper divisors (11456804357).
123344342011 is a wasteful number, since it uses less digits than its factorization.
123344342011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8802.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 123344342011 its reverse (110243443321), we get a palindrome (233587785332).
The spelling of 123344342011 in words is "one hundred twenty-three billion, three hundred forty-four million, three hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •