Base | Representation |
---|---|
bin | 111001010100101110… |
… | …0111010001011010001 |
3 | 102202202012011011010222 |
4 | 1302221130322023101 |
5 | 4004103103341423 |
6 | 132315143202425 |
7 | 11615403560333 |
oct | 1625134721321 |
9 | 382665134128 |
10 | 123102012113 |
11 | 482309707a3 |
12 | 1ba36746415 |
13 | b7baa681b2 |
14 | 5d5b305453 |
15 | 330749a3c8 |
hex | 1ca973a2d1 |
123102012113 has 8 divisors (see below), whose sum is σ = 126234602208. Its totient is φ = 119981683584.
The previous prime is 123102012049. The next prime is 123102012221. The reversal of 123102012113 is 311210201321.
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 123102012113 - 26 = 123102012049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123102012091 and 123102012100.
It is not an unprimeable number, because it can be changed into a prime (123102002113) 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, 3045056 + ... + 3085217.
It is an arithmetic number, because the mean of its divisors is an integer number (15779325276).
Almost surely, 2123102012113 is an apocalyptic number.
It is an amenable number.
123102012113 is a deficient number, since it is larger than the sum of its proper divisors (3132590095).
123102012113 is an equidigital number, since it uses as much as digits as its factorization.
123102012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6130783.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 123102012113 its reverse (311210201321), we get a palindrome (434312213434).
The spelling of 123102012113 in words is "one hundred twenty-three billion, one hundred two million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •