Base | Representation |
---|---|
bin | 111101011001001… |
… | …001000110010001 |
3 | 2122210010110210201 |
4 | 331121021012101 |
5 | 4102140013131 |
6 | 250112255201 |
7 | 34344602326 |
oct | 7531110621 |
9 | 2583113721 |
10 | 1030001041 |
11 | 489455033 |
12 | 248b41501 |
13 | 135512794 |
14 | 9ab1ab4d |
15 | 6065a761 |
hex | 3d649191 |
1030001041 has 2 divisors, whose sum is σ = 1030001042. Its totient is φ = 1030001040.
The previous prime is 1030001003. The next prime is 1030001051. The reversal of 1030001041 is 1401000301.
It is a happy number.
It is an a-pointer prime, because the next prime (1030001051) can be obtained adding 1030001041 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 551310400 + 478690641 = 23480^2 + 21879^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030001041 - 211 = 1029998993 is a prime.
It is a super-2 number, since 2×10300010412 = 2121804288922167362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030001051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515000520 + 515000521.
It is an arithmetic number, because the mean of its divisors is an integer number (515000521).
Almost surely, 21030001041 is an apocalyptic number.
It is an amenable number.
1030001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030001041 is an equidigital number, since it uses as much as digits as its factorization.
1030001041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1030001041 is about 32093.6292899385. The cubic root of 1030001041 is about 1009.9019742788.
Adding to 1030001041 its reverse (1401000301), we get a palindrome (2431001342).
The spelling of 1030001041 in words is "one billion, thirty million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •