Base | Representation |
---|---|
bin | 111001010010000100… |
… | …1110110111111000111 |
3 | 102202111222220120212111 |
4 | 1302210021312333013 |
5 | 4003412330212411 |
6 | 132302250201451 |
7 | 11613244241323 |
oct | 1624411667707 |
9 | 382458816774 |
10 | 123013132231 |
11 | 48195784a50 |
12 | 1ba10a23287 |
13 | b7a5519052 |
14 | 5d4d5aa983 |
15 | 32ee790721 |
hex | 1ca4276fc7 |
123013132231 has 8 divisors (see below), whose sum is σ = 137316985344. Its totient is φ = 109229419320.
The previous prime is 123013132223. The next prime is 123013132271. The reversal of 123013132231 is 132231310321.
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 123013132231 - 23 = 123013132223 is a prime.
It is a super-2 number, since 2×1230131322312 (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 (123013132211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130034551 + ... + 130035496.
It is an arithmetic number, because the mean of its divisors is an integer number (17164623168).
Almost surely, 2123013132231 is an apocalyptic number.
123013132231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123013132231 is a deficient number, since it is larger than the sum of its proper divisors (14303853113).
123013132231 is a wasteful number, since it uses less digits than its factorization.
123013132231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260070101.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 123013132231 its reverse (132231310321), we get a palindrome (255244442552).
The spelling of 123013132231 in words is "one hundred twenty-three billion, thirteen million, one hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •