Base | Representation |
---|---|
bin | 111110000011001… |
… | …011100001101001 |
3 | 2200112212100101120 |
4 | 332003023201221 |
5 | 4113000133113 |
6 | 251144405453 |
7 | 34540350513 |
oct | 7603134151 |
9 | 2615770346 |
10 | 1041021033 |
11 | 4946a1568 |
12 | 250776889 |
13 | 1378a06a0 |
14 | 9c388bb3 |
15 | 615d5a23 |
hex | 3e0cb869 |
1041021033 has 16 divisors (see below), whose sum is σ = 1546345920. Its totient is φ = 618537024.
The previous prime is 1041021031. The next prime is 1041021049. The reversal of 1041021033 is 3301201401.
1041021033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1041021033 - 21 = 1041021031 is a prime.
It is a super-2 number, since 2×10410210332 = 2167449582296774178, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1041021031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 459091 + ... + 461352.
It is an arithmetic number, because the mean of its divisors is an integer number (96646620).
Almost surely, 21041021033 is an apocalyptic number.
1041021033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1041021033 is a deficient number, since it is larger than the sum of its proper divisors (505324887).
1041021033 is a wasteful number, since it uses less digits than its factorization.
1041021033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920488.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1041021033 is about 32264.8575543113. The cubic root of 1041021033 is about 1013.4908560111.
Adding to 1041021033 its reverse (3301201401), we get a palindrome (4342222434).
The spelling of 1041021033 in words is "one billion, forty-one million, twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •