Base | Representation |
---|---|
bin | 111001011011000011… |
… | …1001011110110000010 |
3 | 102210021222211122112022 |
4 | 1302312013023312002 |
5 | 4010021442433442 |
6 | 132352212001442 |
7 | 11623563166514 |
oct | 1626607136602 |
9 | 383258748468 |
10 | 123314421122 |
11 | 4832a859832 |
12 | 1ba95900282 |
13 | b822a786b9 |
14 | 5d7b5d7bb4 |
15 | 331ae563d2 |
hex | 1cb61cbd82 |
123314421122 has 8 divisors (see below), whose sum is σ = 191349963900. Its totient is φ = 59531099824.
The previous prime is 123314421121. The next prime is 123314421149. The reversal of 123314421122 is 221124413321.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 105684158281 + 17630262841 = 325091^2 + 132779^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1233144211223 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123314421091 and 123314421100.
It is not an unprimeable number, because it can be changed into a prime (123314421121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1063055297 + ... + 1063055412.
Almost surely, 2123314421122 is an apocalyptic number.
123314421122 is a deficient number, since it is larger than the sum of its proper divisors (68035542778).
123314421122 is a wasteful number, since it uses less digits than its factorization.
123314421122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2126110740.
The product of its digits is 2304, while the sum is 26.
Adding to 123314421122 its reverse (221124413321), we get a palindrome (344438834443).
The spelling of 123314421122 in words is "one hundred twenty-three billion, three hundred fourteen million, four hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •