Base | Representation |
---|---|
bin | 100010000001001… |
… | …1110010010001001 |
3 | 2221112221011021101 |
4 | 1010002132102021 |
5 | 4314210432032 |
6 | 305134141401 |
7 | 40200403321 |
oct | 10402362211 |
9 | 2845834241 |
10 | 1141499017 |
11 | 53638a11a |
12 | 27a351861 |
13 | 152650909 |
14 | ab862281 |
15 | 6a331de7 |
hex | 4409e489 |
1141499017 has 12 divisors (see below), whose sum is σ = 1214348436. Its totient is φ = 1069303040.
The previous prime is 1141498991. The next prime is 1141499041. The reversal of 1141499017 is 7109941411.
It can be written as a sum of positive squares in 2 ways, for example, as 613602441 + 527896576 = 24771^2 + 22976^2 .
It is not a de Polignac number, because 1141499017 - 27 = 1141498889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1141499057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2190717 + ... + 2191237.
It is an arithmetic number, because the mean of its divisors is an integer number (101195703).
Almost surely, 21141499017 is an apocalyptic number.
1141499017 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1141499017 is a deficient number, since it is larger than the sum of its proper divisors (72849419).
1141499017 is an frugal number, since it uses more digits than its factorization.
1141499017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1256 (or 897 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 37.
The square root of 1141499017 is about 33786.0772656430. The cubic root of 1141499017 is about 1045.1016031793.
The spelling of 1141499017 in words is "one billion, one hundred forty-one million, four hundred ninety-nine thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •