Base | Representation |
---|---|
bin | 111001010100111110… |
… | …0100111110100101111 |
3 | 102202202202210112001002 |
4 | 1302221330213310233 |
5 | 4004112220404201 |
6 | 132320041310515 |
7 | 11615534333633 |
oct | 1625174476457 |
9 | 382682715032 |
10 | 123110325551 |
11 | 48235629804 |
12 | 1ba3949543b |
13 | b7bc6b91a5 |
14 | 5d5c46adc3 |
15 | 330808d76b |
hex | 1ca9f27d2f |
123110325551 has 4 divisors (see below), whose sum is σ = 123193118112. Its totient is φ = 123027532992.
The previous prime is 123110325539. The next prime is 123110325581. The reversal of 123110325551 is 155523011321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155523011321 = 279847 ⋅555743.
It is a cyclic number.
It is not a de Polignac number, because 123110325551 - 210 = 123110324527 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123110325581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41394050 + ... + 41397023.
It is an arithmetic number, because the mean of its divisors is an integer number (30798279528).
Almost surely, 2123110325551 is an apocalyptic number.
123110325551 is a deficient number, since it is larger than the sum of its proper divisors (82792561).
123110325551 is an equidigital number, since it uses as much as digits as its factorization.
123110325551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82792560.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 123110325551 its reverse (155523011321), we get a palindrome (278633336872).
The spelling of 123110325551 in words is "one hundred twenty-three billion, one hundred ten million, three hundred twenty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •