Base | Representation |
---|---|
bin | 111001011111001110… |
… | …0100011100101100011 |
3 | 102210122201221020111212 |
4 | 1302332130203211203 |
5 | 4010313241203443 |
6 | 132414124500335 |
7 | 11630211510143 |
oct | 1627634434543 |
9 | 383581836455 |
10 | 123454241123 |
11 | 483a1778654 |
12 | 1bb146aa6ab |
13 | b845a21b25 |
14 | 5d91dd2923 |
15 | 3328374618 |
hex | 1cbe723963 |
123454241123 has 4 divisors (see below), whose sum is σ = 128821816848. Its totient is φ = 118086665400.
The previous prime is 123454241089. The next prime is 123454241161. The reversal of 123454241123 is 321142454321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123454241123 is a prime.
It is a super-2 number, since 2×1234542411232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123454241123.
It is not an unprimeable number, because it can be changed into a prime (123454241423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2683787828 + ... + 2683787873.
It is an arithmetic number, because the mean of its divisors is an integer number (32205454212).
Almost surely, 2123454241123 is an apocalyptic number.
123454241123 is a deficient number, since it is larger than the sum of its proper divisors (5367575725).
123454241123 is an equidigital number, since it uses as much as digits as its factorization.
123454241123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5367575724.
The product of its digits is 23040, while the sum is 32.
Adding to 123454241123 its reverse (321142454321), we get a palindrome (444596695444).
The spelling of 123454241123 in words is "one hundred twenty-three billion, four hundred fifty-four million, two hundred forty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •