Base | Representation |
---|---|
bin | 10110100010111100… |
… | …11001101001101011 |
3 | 1011020120110021211112 |
4 | 23101132121221223 |
5 | 144242202421443 |
6 | 5321034020535 |
7 | 605646132116 |
oct | 132136315153 |
9 | 34216407745 |
10 | 12104342123 |
11 | 5151649435 |
12 | 241987774b |
13 | 11ab968823 |
14 | 82b81d57d |
15 | 4ac9d1b18 |
hex | 2d1799a6b |
12104342123 has 4 divisors (see below), whose sum is σ = 12104562360. Its totient is φ = 12104121888.
The previous prime is 12104342093. The next prime is 12104342149. The reversal of 12104342123 is 32124340121.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 32124340121 = 67 ⋅479467763.
It is a cyclic number.
It is not a de Polignac number, because 12104342123 - 26 = 12104342059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12104342183) 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 3 ways as a sum of consecutive naturals, for example, 48083 + ... + 162851.
It is an arithmetic number, because the mean of its divisors is an integer number (3026140590).
Almost surely, 212104342123 is an apocalyptic number.
12104342123 is a deficient number, since it is larger than the sum of its proper divisors (220237).
12104342123 is a wasteful number, since it uses less digits than its factorization.
12104342123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220236.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12104342123 its reverse (32124340121), we get a palindrome (44228682244).
The spelling of 12104342123 in words is "twelve billion, one hundred four million, three hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •