Base | Representation |
---|---|
bin | 111100010100011… |
… | …1111000100111001 |
3 | 12020001112100210212 |
4 | 1320220333010321 |
5 | 13121121310131 |
6 | 532501320505 |
7 | 101104541624 |
oct | 17050770471 |
9 | 5201470725 |
10 | 2024010041 |
11 | 949556779 |
12 | 485a06135 |
13 | 263432aa1 |
14 | 152b48dbb |
15 | bca56a2b |
hex | 78a3f139 |
2024010041 has 2 divisors, whose sum is σ = 2024010042. Its totient is φ = 2024010040.
The previous prime is 2024010031. The next prime is 2024010067. The reversal of 2024010041 is 1400104202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1991747641 + 32262400 = 44629^2 + 5680^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2024010041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2024009998 and 2024010025.
It is not a weakly prime, because it can be changed into another prime (2024010011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1012005020 + 1012005021.
It is an arithmetic number, because the mean of its divisors is an integer number (1012005021).
Almost surely, 22024010041 is an apocalyptic number.
It is an amenable number.
2024010041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2024010041 is an equidigital number, since it uses as much as digits as its factorization.
2024010041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2024010041 is about 44988.9991108938. Note that the first 3 decimals coincide. The cubic root of 2024010041 is about 1264.9428004570.
Adding to 2024010041 its reverse (1400104202), we get a palindrome (3424114243).
The spelling of 2024010041 in words is "two billion, twenty-four million, ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •