Base | Representation |
---|---|
bin | 11100010001010000101011… |
… | …010101000000110111101001 |
3 | 121022012222011211201002110212 |
4 | 130101100223111000313221 |
5 | 112244021242143312411 |
6 | 1120233024120550505 |
7 | 35121435664421624 |
oct | 3421205325006751 |
9 | 538188154632425 |
10 | 124331440213481 |
11 | 36685738760886 |
12 | 11b40323922435 |
13 | 544b534907607 |
14 | 229b960d38dbb |
15 | e5922d08368b |
hex | 71142b540de9 |
124331440213481 has 2 divisors, whose sum is σ = 124331440213482. Its totient is φ = 124331440213480.
The previous prime is 124331440213433. The next prime is 124331440213507. The reversal of 124331440213481 is 184312044133421.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124007912461456 + 323527752025 = 11135884^2 + 568795^2 .
It is a cyclic number.
It is not a de Polignac number, because 124331440213481 - 218 = 124331439951337 is a prime.
It is a super-2 number, since 2×1243314402134812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (124331440213081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62165720106740 + 62165720106741.
It is an arithmetic number, because the mean of its divisors is an integer number (62165720106741).
Almost surely, 2124331440213481 is an apocalyptic number.
It is an amenable number.
124331440213481 is a deficient number, since it is larger than the sum of its proper divisors (1).
124331440213481 is an equidigital number, since it uses as much as digits as its factorization.
124331440213481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 221184, while the sum is 41.
The spelling of 124331440213481 in words is "one hundred twenty-four trillion, three hundred thirty-one billion, four hundred forty million, two hundred thirteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •