Base | Representation |
---|---|
bin | 111110000011100… |
… | …010000011010111 |
3 | 2200120001000221222 |
4 | 332003202003113 |
5 | 4113011111203 |
6 | 251150400555 |
7 | 34541213516 |
oct | 7603420327 |
9 | 2616030858 |
10 | 1041113303 |
11 | 49475491a |
12 | 25080015b |
13 | 137903699 |
14 | 9c3b067d |
15 | 61603038 |
hex | 3e0e20d7 |
1041113303 has 8 divisors (see below), whose sum is σ = 1160374320. Its totient is φ = 928298880.
The previous prime is 1041113263. The next prime is 1041113329. The reversal of 1041113303 is 3033111401.
1041113303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1041113303 - 212 = 1041109207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041116303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1611308 + ... + 1611953.
It is an arithmetic number, because the mean of its divisors is an integer number (145046790).
Almost surely, 21041113303 is an apocalyptic number.
1041113303 is a deficient number, since it is larger than the sum of its proper divisors (119261017).
1041113303 is a wasteful number, since it uses less digits than its factorization.
1041113303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3223297.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1041113303 is about 32266.2874065177. The cubic root of 1041113303 is about 1013.5207984220.
Adding to 1041113303 its reverse (3033111401), we get a palindrome (4074224704).
The spelling of 1041113303 in words is "one billion, forty-one million, one hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •