Base | Representation |
---|---|
bin | 111100110011000… |
… | …111100000010001 |
3 | 2122002101001021112 |
4 | 330303013200101 |
5 | 4042112024131 |
6 | 245114503105 |
7 | 34164065156 |
oct | 7463074021 |
9 | 2562331245 |
10 | 1020033041 |
11 | 483866a15 |
12 | 245734a95 |
13 | 133432661 |
14 | 9968422d |
15 | 5e83c02b |
hex | 3ccc7811 |
1020033041 has 2 divisors, whose sum is σ = 1020033042. Its totient is φ = 1020033040.
The previous prime is 1020033023. The next prime is 1020033043. The reversal of 1020033041 is 1403300201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 900240016 + 119793025 = 30004^2 + 10945^2 .
It is an emirp because it is prime and its reverse (1403300201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1020033041 - 226 = 952924177 is a prime.
It is a super-3 number, since 3×10200330413 (a number of 28 digits) contains 333 as substring.
Together with 1020033043, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1020033043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510016520 + 510016521.
It is an arithmetic number, because the mean of its divisors is an integer number (510016521).
Almost surely, 21020033041 is an apocalyptic number.
It is an amenable number.
1020033041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020033041 is an equidigital number, since it uses as much as digits as its factorization.
1020033041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1020033041 is about 31937.9561180737. The cubic root of 1020033041 is about 1006.6335786653.
Adding to 1020033041 its reverse (1403300201), we get a palindrome (2423333242).
The spelling of 1020033041 in words is "one billion, twenty million, thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •