Base | Representation |
---|---|
bin | 100010000000011… |
… | …0010001111010111 |
3 | 2221112002200012210 |
4 | 1010000302033113 |
5 | 4314102301341 |
6 | 305120444503 |
7 | 40163551152 |
oct | 10400621727 |
9 | 2845080183 |
10 | 1141056471 |
11 | 536107685 |
12 | 27a179733 |
13 | 152527359 |
14 | ab788c99 |
15 | 6a295c16 |
hex | 440323d7 |
1141056471 has 8 divisors (see below), whose sum is σ = 1556790400. Its totient is φ = 743013432.
The previous prime is 1141056467. The next prime is 1141056479. The reversal of 1141056471 is 1746501411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1141056471 - 22 = 1141056467 is a prime.
It is a super-3 number, since 3×11410564713 (a number of 28 digits) contains 333 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 (1141056479) 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, 4422571 + ... + 4422828.
It is an arithmetic number, because the mean of its divisors is an integer number (194598800).
Almost surely, 21141056471 is an apocalyptic number.
1141056471 is a deficient number, since it is larger than the sum of its proper divisors (415733929).
1141056471 is an equidigital number, since it uses as much as digits as its factorization.
1141056471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8845445.
The product of its (nonzero) digits is 3360, while the sum is 30.
The square root of 1141056471 is about 33779.5273945625. The cubic root of 1141056471 is about 1044.9665277772.
Adding to 1141056471 its reverse (1746501411), we get a palindrome (2887557882).
The spelling of 1141056471 in words is "one billion, one hundred forty-one million, fifty-six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •