Base | Representation |
---|---|
bin | 111001010101110111… |
… | …0010001111100000001 |
3 | 102202211211212020210002 |
4 | 1302223232101330001 |
5 | 4004142332322241 |
6 | 132323024045345 |
7 | 11616345516101 |
oct | 1625356217401 |
9 | 382754766702 |
10 | 123140120321 |
11 | 48250429a89 |
12 | 1ba47463855 |
13 | b7c591b92a |
14 | 5d623c5201 |
15 | 330a9c689b |
hex | 1cabb91f01 |
123140120321 has 8 divisors (see below), whose sum is σ = 123558576000. Its totient is φ = 122722116048.
The previous prime is 123140120291. The next prime is 123140120333. The reversal of 123140120321 is 123021041321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123140120321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123140120293 and 123140120302.
It is not an unprimeable number, because it can be changed into a prime (123140120351) 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, 438215 + ... + 662051.
It is an arithmetic number, because the mean of its divisors is an integer number (15444822000).
Almost surely, 2123140120321 is an apocalyptic number.
It is an amenable number.
123140120321 is a deficient number, since it is larger than the sum of its proper divisors (418455679).
123140120321 is a wasteful number, since it uses less digits than its factorization.
123140120321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225703.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 123140120321 its reverse (123021041321), we get a palindrome (246161161642).
The spelling of 123140120321 in words is "one hundred twenty-three billion, one hundred forty million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •