Base | Representation |
---|---|
bin | 111011110110000… |
… | …011000100100101 |
3 | 2120222020201010211 |
4 | 323312003010211 |
5 | 4024012232401 |
6 | 243343415421 |
7 | 33611030653 |
oct | 7366030445 |
9 | 2528221124 |
10 | 1004024101 |
11 | 475822193 |
12 | 2402b4571 |
13 | 130018a02 |
14 | 974b7dd3 |
15 | 5d228951 |
hex | 3bd83125 |
1004024101 has 2 divisors, whose sum is σ = 1004024102. Its totient is φ = 1004024100.
The previous prime is 1004024089. The next prime is 1004024107. The reversal of 1004024101 is 1014204001.
1004024101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 676052001 + 327972100 = 26001^2 + 18110^2 .
It is an emirp because it is prime and its reverse (1014204001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1004024101 - 25 = 1004024069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1004024107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502012050 + 502012051.
It is an arithmetic number, because the mean of its divisors is an integer number (502012051).
Almost surely, 21004024101 is an apocalyptic number.
It is an amenable number.
1004024101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004024101 is an equidigital number, since it uses as much as digits as its factorization.
1004024101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 1004024101 is about 31686.3393436351. The cubic root of 1004024101 is about 1001.3395717463.
Adding to 1004024101 its reverse (1014204001), we get a palindrome (2018228102).
The spelling of 1004024101 in words is "one billion, four million, twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •