Base | Representation |
---|---|
bin | 100010000001000… |
… | …0111001010001111 |
3 | 2221112202100100110 |
4 | 1010002013022033 |
5 | 4314144414203 |
6 | 305132131103 |
7 | 40166530224 |
oct | 10402071217 |
9 | 2845670313 |
10 | 1141404303 |
11 | 536324a46 |
12 | 27a306a93 |
13 | 152619780 |
14 | ab83994b |
15 | 6a313d03 |
hex | 4408728f |
1141404303 has 8 divisors (see below), whose sum is σ = 1638939568. Its totient is φ = 702402624.
The previous prime is 1141404269. The next prime is 1141404311. The reversal of 1141404303 is 3034041411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1141404303 - 26 = 1141404239 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1141404303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141404503) 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, 14633350 + ... + 14633427.
It is an arithmetic number, because the mean of its divisors is an integer number (204867446).
Almost surely, 21141404303 is an apocalyptic number.
1141404303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1141404303 is a deficient number, since it is larger than the sum of its proper divisors (497535265).
1141404303 is a wasteful number, since it uses less digits than its factorization.
1141404303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29266793.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1141404303 is about 33784.6755645219. The cubic root of 1141404303 is about 1045.0726971854.
Adding to 1141404303 its reverse (3034041411), we get a palindrome (4175445714).
The spelling of 1141404303 in words is "one billion, one hundred forty-one million, four hundred four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •