Base | Representation |
---|---|
bin | 11100010001100011110101… |
… | …111111111001110000011001 |
3 | 121022021221022002210222212102 |
4 | 130101203311333321300121 |
5 | 112244340414200321403 |
6 | 1120250310212053145 |
7 | 35123064662444144 |
oct | 3421436577716031 |
9 | 538257262728772 |
10 | 124352020323353 |
11 | 36693439692a49 |
12 | 11b443080041b5 |
13 | 5450464535714 |
14 | 229c9542ab05b |
15 | e59a34bddb88 |
hex | 7118f5ff9c19 |
124352020323353 has 2 divisors, whose sum is σ = 124352020323354. Its totient is φ = 124352020323352.
The previous prime is 124352020323239. The next prime is 124352020323389. The reversal of 124352020323353 is 353323020253421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106418040391744 + 17933979931609 = 10315912^2 + 4234853^2 .
It is a cyclic number.
It is not a de Polignac number, because 124352020323353 - 228 = 124351751887897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (124352020322353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62176010161676 + 62176010161677.
It is an arithmetic number, because the mean of its divisors is an integer number (62176010161677).
Almost surely, 2124352020323353 is an apocalyptic number.
It is an amenable number.
124352020323353 is a deficient number, since it is larger than the sum of its proper divisors (1).
124352020323353 is an equidigital number, since it uses as much as digits as its factorization.
124352020323353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 38.
Adding to 124352020323353 its reverse (353323020253421), we get a palindrome (477675040576774).
The spelling of 124352020323353 in words is "one hundred twenty-four trillion, three hundred fifty-two billion, twenty million, three hundred twenty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •