Base | Representation |
---|---|
bin | 111001011000000010… |
… | …1000110110111000011 |
3 | 102210000221101202020220 |
4 | 1302300011012313003 |
5 | 4004320040304443 |
6 | 132334154434123 |
7 | 11621224013460 |
oct | 1626005066703 |
9 | 383027352226 |
10 | 123213213123 |
11 | 48288712760 |
12 | 1ba67a32943 |
13 | b807b01100 |
14 | 5d6bdb0667 |
15 | 3312113a83 |
hex | 1cb0146dc3 |
123213213123 has 192 divisors, whose sum is σ = 234865889280. Its totient is φ = 55697241600.
The previous prime is 123213213089. The next prime is 123213213131. The reversal of 123213213123 is 321312312321.
It is not a de Polignac number, because 123213213123 - 210 = 123213212099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123213213093 and 123213213102.
It is not an unprimeable number, because it can be changed into a prime (123213213133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 48680368 + ... + 48682898.
It is an arithmetic number, because the mean of its divisors is an integer number (1223259840).
Almost surely, 2123213213123 is an apocalyptic number.
123213213123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
123213213123 is a deficient number, since it is larger than the sum of its proper divisors (111652676157).
123213213123 is a wasteful number, since it uses less digits than its factorization.
123213213123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2650 (or 2637 counting only the distinct ones).
The product of its digits is 1296, while the sum is 24.
Adding to 123213213123 its reverse (321312312321), we get a palindrome (444525525444).
The spelling of 123213213123 in words is "one hundred twenty-three billion, two hundred thirteen million, two hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •