Base | Representation |
---|---|
bin | 111111010111111… |
… | …100011010010001 |
3 | 2202002200020221200 |
4 | 333113330122101 |
5 | 4134142210421 |
6 | 253300541413 |
7 | 35230255020 |
oct | 7727743221 |
9 | 2662606850 |
10 | 1063241361 |
11 | 4a6198a76 |
12 | 2580b1869 |
13 | 13c380600 |
14 | a12d08b7 |
15 | 63524726 |
hex | 3f5fc691 |
1063241361 has 72 divisors (see below), whose sum is σ = 1952683200. Its totient is φ = 545470848.
The previous prime is 1063241359. The next prime is 1063241369. The reversal of 1063241361 is 1631423601.
1063241361 is a `hidden beast` number, since 1 + 0 + 63 + 241 + 361 = 666.
It is not a de Polignac number, because 1063241361 - 21 = 1063241359 is a prime.
It is a super-2 number, since 2×10632413612 = 2260964383482264642, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1063241369) 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 71 ways as a sum of consecutive naturals, for example, 392590 + ... + 395288.
It is an arithmetic number, because the mean of its divisors is an integer number (27120600).
Almost surely, 21063241361 is an apocalyptic number.
It is an amenable number.
1063241361 is a deficient number, since it is larger than the sum of its proper divisors (889441839).
1063241361 is a wasteful number, since it uses less digits than its factorization.
1063241361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2775 (or 2759 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 1063241361 is about 32607.3820016266. The cubic root of 1063241361 is about 1020.6510520587.
Adding to 1063241361 its reverse (1631423601), we get a palindrome (2694664962).
The spelling of 1063241361 in words is "one billion, sixty-three million, two hundred forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •