Base | Representation |
---|---|
bin | 111111100011011… |
… | …000110001110111 |
3 | 2202022022122212201 |
4 | 333203120301313 |
5 | 4140424204033 |
6 | 253445125331 |
7 | 35264620522 |
oct | 7743306167 |
9 | 2668278781 |
10 | 1066241143 |
11 | 4a7957830 |
12 | 2590b9847 |
13 | 13cb90b26 |
14 | a1871bb9 |
15 | 6391847d |
hex | 3f8d8c77 |
1066241143 has 16 divisors (see below), whose sum is σ = 1194021792. Its totient is φ = 943920000.
The previous prime is 1066241131. The next prime is 1066241159. The reversal of 1066241143 is 3411426601.
It is a cyclic number.
It is not a de Polignac number, because 1066241143 - 29 = 1066240631 is a prime.
It is a super-2 number, since 2×10662411432 = 2273740350051892898, 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 (1066241123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59905 + ... + 75637.
It is an arithmetic number, because the mean of its divisors is an integer number (74626362).
Almost surely, 21066241143 is an apocalyptic number.
1066241143 is a deficient number, since it is larger than the sum of its proper divisors (127780649).
1066241143 is a wasteful number, since it uses less digits than its factorization.
1066241143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15906.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 1066241143 is about 32653.3481131721. The cubic root of 1066241143 is about 1021.6100239538.
Adding to 1066241143 its reverse (3411426601), we get a palindrome (4477667744).
The spelling of 1066241143 in words is "one billion, sixty-six million, two hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •