Base | Representation |
---|---|
bin | 11100010010110101111001… |
… | …001001100111101111010101 |
3 | 121022121100200220221220121102 |
4 | 130102311321021213233111 |
5 | 112302311331212012323 |
6 | 1120355000230355445 |
7 | 35132334115556246 |
oct | 3422657111475725 |
9 | 538540626856542 |
10 | 124440120032213 |
11 | 3671783867a197 |
12 | 11b593b44bbb85 |
13 | 545886475176b |
14 | 22a2d10a66ccd |
15 | e5be8e301328 |
hex | 712d79267bd5 |
124440120032213 has 2 divisors, whose sum is σ = 124440120032214. Its totient is φ = 124440120032212.
The previous prime is 124440120032197. The next prime is 124440120032297. The reversal of 124440120032213 is 312230021044421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82577240188804 + 41862879843409 = 9087202^2 + 6470153^2 .
It is a cyclic number.
It is not a de Polignac number, because 124440120032213 - 24 = 124440120032197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124440120034213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62220060016106 + 62220060016107.
It is an arithmetic number, because the mean of its divisors is an integer number (62220060016107).
Almost surely, 2124440120032213 is an apocalyptic number.
It is an amenable number.
124440120032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
124440120032213 is an equidigital number, since it uses as much as digits as its factorization.
124440120032213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 124440120032213 its reverse (312230021044421), we get a palindrome (436670141076634).
The spelling of 124440120032213 in words is "one hundred twenty-four trillion, four hundred forty billion, one hundred twenty million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •