Base | Representation |
---|---|
bin | 111001011000010111… |
… | …0110101000000100011 |
3 | 102210001200222101220022 |
4 | 1302300232311000203 |
5 | 4004330340300201 |
6 | 132335225104055 |
7 | 11621415664532 |
oct | 1626056650043 |
9 | 383050871808 |
10 | 123224150051 |
11 | 48293902842 |
12 | 1ba6b62802b |
13 | b80a160272 |
14 | 5d6d61a319 |
15 | 331307441b |
hex | 1cb0bb5023 |
123224150051 has 4 divisors (see below), whose sum is σ = 123226020000. Its totient is φ = 123222280104.
The previous prime is 123224150041. The next prime is 123224150099. The reversal of 123224150051 is 150051422321.
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-123224150051 is a prime.
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 123224150051.
It is not an unprimeable number, because it can be changed into a prime (123224150041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 832376 + ... + 969173.
It is an arithmetic number, because the mean of its divisors is an integer number (30806505000).
Almost surely, 2123224150051 is an apocalyptic number.
123224150051 is a deficient number, since it is larger than the sum of its proper divisors (1869949).
123224150051 is an equidigital number, since it uses as much as digits as its factorization.
123224150051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869948.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 123224150051 its reverse (150051422321), we get a palindrome (273275572372).
The spelling of 123224150051 in words is "one hundred twenty-three billion, two hundred twenty-four million, one hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •