Base | Representation |
---|---|
bin | 111001011011010000… |
… | …1000101110011100011 |
3 | 102210022110121200001011 |
4 | 1302312201011303203 |
5 | 4010030212242011 |
6 | 132353013321351 |
7 | 11624005002415 |
oct | 1626641056343 |
9 | 383273550034 |
10 | 123321212131 |
11 | 48333677a37 |
12 | 1ba98036257 |
13 | b8242b5750 |
14 | 5d7c4849b5 |
15 | 331b848621 |
hex | 1cb6845ce3 |
123321212131 has 8 divisors (see below), whose sum is σ = 133436881424. Its totient is φ = 113295460320.
The previous prime is 123321212093. The next prime is 123321212153. The reversal of 123321212131 is 131212123321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123321212131 - 223 = 123312823523 is a prime.
It is a super-2 number, since 2×1233212121312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123321212731) 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 7 ways as a sum of consecutive naturals, for example, 22476516 + ... + 22482001.
It is an arithmetic number, because the mean of its divisors is an integer number (16679610178).
Almost surely, 2123321212131 is an apocalyptic number.
123321212131 is a deficient number, since it is larger than the sum of its proper divisors (10115669293).
123321212131 is a wasteful number, since it uses less digits than its factorization.
123321212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44958741.
The product of its digits is 432, while the sum is 22.
Adding to 123321212131 its reverse (131212123321), we get a palindrome (254533335452).
The spelling of 123321212131 in words is "one hundred twenty-three billion, three hundred twenty-one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •