Base | Representation |
---|---|
bin | 1010111110101000001010… |
… | …11010111111100100101001 |
3 | 10011110221222121101111202002 |
4 | 11133110011122333210221 |
5 | 11131021011121224113 |
6 | 123202421214020345 |
7 | 5041131540154043 |
oct | 537240532774451 |
9 | 104427877344662 |
10 | 24142102133033 |
11 | 77686762a8475 |
12 | 285aa991a76b5 |
13 | 106178a328151 |
14 | 5d66ac06ca93 |
15 | 2bced139bc58 |
hex | 15f5056bf929 |
24142102133033 has 2 divisors, whose sum is σ = 24142102133034. Its totient is φ = 24142102133032.
The previous prime is 24142102132979. The next prime is 24142102133059. The reversal of 24142102133033 is 33033120124142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22888837555984 + 1253264577049 = 4784228^2 + 1119493^2 .
It is a cyclic number.
It is not a de Polignac number, because 24142102133033 - 210 = 24142102132009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 24142102132987 and 24142102133005.
It is not a weakly prime, because it can be changed into another prime (24142102133333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12071051066516 + 12071051066517.
It is an arithmetic number, because the mean of its divisors is an integer number (12071051066517).
Almost surely, 224142102133033 is an apocalyptic number.
It is an amenable number.
24142102133033 is a deficient number, since it is larger than the sum of its proper divisors (1).
24142102133033 is an equidigital number, since it uses as much as digits as its factorization.
24142102133033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 24142102133033 its reverse (33033120124142), we get a palindrome (57175222257175).
The spelling of 24142102133033 in words is "twenty-four trillion, one hundred forty-two billion, one hundred two million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •