Base | Representation |
---|---|
bin | 100010000000010… |
… | …1001101001110111 |
3 | 2221112000212222021 |
4 | 1010000221221313 |
5 | 4314100140203 |
6 | 305120014011 |
7 | 40163343502 |
oct | 10400515167 |
9 | 2845025867 |
10 | 1141021303 |
11 | 536093214 |
12 | 27a161307 |
13 | 152514346 |
14 | ab77a139 |
15 | 6a28a5bd |
hex | 44029a77 |
1141021303 has 8 divisors (see below), whose sum is σ = 1166457600. Its totient is φ = 1115633400.
The previous prime is 1141021241. The next prime is 1141021313. The reversal of 1141021303 is 3031201411.
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 1141021303 - 221 = 1138924151 is a prime.
It is a super-2 number, since 2×11410213032 = 2603859227799635618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141021313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37848 + ... + 60946.
It is an arithmetic number, because the mean of its divisors is an integer number (145807200).
Almost surely, 21141021303 is an apocalyptic number.
1141021303 is a deficient number, since it is larger than the sum of its proper divisors (25436297).
1141021303 is a wasteful number, since it uses less digits than its factorization.
1141021303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24197.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1141021303 is about 33779.0068385676. The cubic root of 1141021303 is about 1044.9557921822.
Adding to 1141021303 its reverse (3031201411), we get a palindrome (4172222714).
The spelling of 1141021303 in words is "one billion, one hundred forty-one million, twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •