Base | Representation |
---|---|
bin | 11100000010100101101100… |
… | …010000011010101101111000 |
3 | 121011122120202200211221101102 |
4 | 130002211230100122231320 |
5 | 112131011414311304422 |
6 | 1114141522423510532 |
7 | 34655544110005412 |
oct | 3402455420325570 |
9 | 534576680757342 |
10 | 123323212213112 |
11 | 363270982a048a |
12 | 119b8a462b8448 |
13 | 53a7437ab9902 |
14 | 2264c37c379b2 |
15 | e3cdbe2d6192 |
hex | 70296c41ab78 |
123323212213112 has 8 divisors (see below), whose sum is σ = 231231022899600. Its totient is φ = 61661606106552.
The previous prime is 123323212213111. The next prime is 123323212213121. The reversal of 123323212213112 is 211312212323321.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1233232122131122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123323212213111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7707700763312 + ... + 7707700763327.
It is an arithmetic number, because the mean of its divisors is an integer number (28903877862450).
Almost surely, 2123323212213112 is an apocalyptic number.
It is an amenable number.
123323212213112 is a deficient number, since it is larger than the sum of its proper divisors (107907810686488).
123323212213112 is a wasteful number, since it uses less digits than its factorization.
123323212213112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15415401526645 (or 15415401526641 counting only the distinct ones).
The product of its digits is 5184, while the sum is 29.
Adding to 123323212213112 its reverse (211312212323321), we get a palindrome (334635424536433).
The spelling of 123323212213112 in words is "one hundred twenty-three trillion, three hundred twenty-three billion, two hundred twelve million, two hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •