Base | Representation |
---|---|
bin | 11100010001001111101110… |
… | …110000100111111110010001 |
3 | 121022012212120000121012101102 |
4 | 130101033232300213332101 |
5 | 112244012202023310421 |
6 | 1120232335220514145 |
7 | 35121401545203656 |
oct | 3421175660477621 |
9 | 538185500535342 |
10 | 124330424041361 |
11 | 366852670a170a |
12 | 11b4009b54b955 |
13 | 544b402227435 |
14 | 229b8a5dbbc2d |
15 | e591bdc5a60b |
hex | 7113eec27f91 |
124330424041361 has 2 divisors, whose sum is σ = 124330424041362. Its totient is φ = 124330424041360.
The previous prime is 124330424041357. The next prime is 124330424041459. The reversal of 124330424041361 is 163140424033421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106555430759761 + 17774993281600 = 10322569^2 + 4216040^2 .
It is a cyclic number.
It is not a de Polignac number, because 124330424041361 - 22 = 124330424041357 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 (124330424041331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62165212020680 + 62165212020681.
It is an arithmetic number, because the mean of its divisors is an integer number (62165212020681).
Almost surely, 2124330424041361 is an apocalyptic number.
It is an amenable number.
124330424041361 is a deficient number, since it is larger than the sum of its proper divisors (1).
124330424041361 is an equidigital number, since it uses as much as digits as its factorization.
124330424041361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 165888, while the sum is 38.
Adding to 124330424041361 its reverse (163140424033421), we get a palindrome (287470848074782).
The spelling of 124330424041361 in words is "one hundred twenty-four trillion, three hundred thirty billion, four hundred twenty-four million, forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •