Base | Representation |
---|---|
bin | 111111100011011… |
… | …001000100111001 |
3 | 2202022022201112211 |
4 | 333203121010321 |
5 | 4140424223421 |
6 | 253445135121 |
7 | 35264624212 |
oct | 7743310471 |
9 | 2668281484 |
10 | 1066242361 |
11 | 4a7958738 |
12 | 2590ba4a1 |
13 | 13cb91552 |
14 | a1872409 |
15 | 639189e1 |
hex | 3f8d9139 |
1066242361 has 8 divisors (see below), whose sum is σ = 1129896000. Its totient is φ = 1003342320.
The previous prime is 1066242347. The next prime is 1066242377. The reversal of 1066242361 is 1632426601.
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 1066242361 - 211 = 1066240313 is a prime.
It is a super-2 number, since 2×10662423612 = 2273745544781708642, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1066242341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 185485 + ... + 191146.
It is an arithmetic number, because the mean of its divisors is an integer number (141237000).
Almost surely, 21066242361 is an apocalyptic number.
It is an amenable number.
1066242361 is a deficient number, since it is larger than the sum of its proper divisors (63653639).
1066242361 is a wasteful number, since it uses less digits than its factorization.
1066242361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376799.
The product of its (nonzero) digits is 10368, while the sum is 31.
The square root of 1066242361 is about 32653.3667636279. The cubic root of 1066242361 is about 1021.6104129591.
Adding to 1066242361 its reverse (1632426601), we get a palindrome (2698668962).
The spelling of 1066242361 in words is "one billion, sixty-six million, two hundred forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •