Base | Representation |
---|---|
bin | 111111011000010… |
… | …100101001100001 |
3 | 2202002212022010201 |
4 | 333120110221201 |
5 | 4134203400031 |
6 | 253303025201 |
7 | 35231150326 |
oct | 7730245141 |
9 | 2662768121 |
10 | 1063340641 |
11 | 4a6256620 |
12 | 25813b201 |
13 | 13c3b685c |
14 | a1318b4d |
15 | 63543d61 |
hex | 3f614a61 |
1063340641 has 32 divisors (see below), whose sum is σ = 1222926336. Its totient is φ = 915840000.
The previous prime is 1063340627. The next prime is 1063340693. The reversal of 1063340641 is 1460433601.
1063340641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1063340641 - 225 = 1029786209 is a prime.
It is a super-2 number, since 2×10633406412 = 2261386637604581762, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1063340611) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5509441 + ... + 5509633.
It is an arithmetic number, because the mean of its divisors is an integer number (38216448).
Almost surely, 21063340641 is an apocalyptic number.
1063340641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1063340641 is a deficient number, since it is larger than the sum of its proper divisors (159585695).
1063340641 is a wasteful number, since it uses less digits than its factorization.
1063340641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493.
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 1063340641 is about 32608.9043207526. The cubic root of 1063340641 is about 1020.6828187821.
The spelling of 1063340641 in words is "one billion, sixty-three million, three hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •