Base | Representation |
---|---|
bin | 111001010010000011… |
… | …0101110010001110100 |
3 | 102202111221100211011101 |
4 | 1302210012232101310 |
5 | 4003412122411012 |
6 | 132302220415444 |
7 | 11613234245455 |
oct | 1624406562164 |
9 | 382457324141 |
10 | 123012310132 |
11 | 48195273328 |
12 | 1ba106a7584 |
13 | b7a52bbaba |
14 | 5d4d43512c |
15 | 32ee67bd57 |
hex | 1ca41ae474 |
123012310132 has 12 divisors (see below), whose sum is σ = 217690324740. Its totient is φ = 60815074496.
The previous prime is 123012310123. The next prime is 123012310139. The reversal of 123012310132 is 231013210321.
It can be written as a sum of positive squares in 2 ways, for example, as 27187392996 + 95824917136 = 164886^2 + 309556^2 .
It is a super-2 number, since 2×1230123101322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123012310139) 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 3 ways as a sum of consecutive naturals, for example, 172769743 + ... + 172770454.
It is an arithmetic number, because the mean of its divisors is an integer number (18140860395).
Almost surely, 2123012310132 is an apocalyptic number.
It is an amenable number.
123012310132 is a deficient number, since it is larger than the sum of its proper divisors (94678014608).
123012310132 is a wasteful number, since it uses less digits than its factorization.
123012310132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345540290 (or 345540288 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 123012310132 its reverse (231013210321), we get a palindrome (354025520453).
The spelling of 123012310132 in words is "one hundred twenty-three billion, twelve million, three hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •