Base | Representation |
---|---|
bin | 111001011000010111… |
… | …0010011000011100001 |
3 | 102210001200201100010102 |
4 | 1302300232103003201 |
5 | 4004330321322402 |
6 | 132335222112145 |
7 | 11621414545214 |
oct | 1626056230341 |
9 | 383050640112 |
10 | 123224010977 |
11 | 48293818301 |
12 | 1ba6b57b655 |
13 | b80a111b82 |
14 | 5d6d5c177b |
15 | 3313048102 |
hex | 1cb0b930e1 |
123224010977 has 2 divisors, whose sum is σ = 123224010978. Its totient is φ = 123224010976.
The previous prime is 123224010941. The next prime is 123224010979. The reversal of 123224010977 is 779010422321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67246343761 + 55977667216 = 259319^2 + 236596^2 .
It is a cyclic number.
It is not a de Polignac number, because 123224010977 - 26 = 123224010913 is a prime.
Together with 123224010979, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123224010977.
It is not a weakly prime, because it can be changed into another prime (123224010979) 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 as a sum of consecutive naturals, namely, 61612005488 + 61612005489.
It is an arithmetic number, because the mean of its divisors is an integer number (61612005489).
Almost surely, 2123224010977 is an apocalyptic number.
It is an amenable number.
123224010977 is a deficient number, since it is larger than the sum of its proper divisors (1).
123224010977 is an equidigital number, since it uses as much as digits as its factorization.
123224010977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 123224010977 in words is "one hundred twenty-three billion, two hundred twenty-four million, ten thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •