Base | Representation |
---|---|
bin | 10011110111001000… |
… | …01010001101000111 |
3 | 1000112010100002102122 |
4 | 21323210022031013 |
5 | 133314212324033 |
6 | 4522025200155 |
7 | 525145046021 |
oct | 117344121507 |
9 | 30463302378 |
10 | 10663011143 |
11 | 4581aa0104 |
12 | 209703005b |
13 | 100c178765 |
14 | 73222d011 |
15 | 4261c5a98 |
hex | 27b90a347 |
10663011143 has 6 divisors (see below), whose sum is σ = 10673281584. Its totient is φ = 10652750376.
The previous prime is 10663011091. The next prime is 10663011181. The reversal of 10663011143 is 34111036601.
10663011143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10663011143 - 210 = 10663010119 is a prime.
It is a super-2 number, since 2×106630111432 (a number of 21 digits) 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 (10663010143) 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 5 ways as a sum of consecutive naturals, for example, 1467746 + ... + 1474992.
It is an arithmetic number, because the mean of its divisors is an integer number (1778880264).
Almost surely, 210663011143 is an apocalyptic number.
10663011143 is a deficient number, since it is larger than the sum of its proper divisors (10270441).
10663011143 is an frugal number, since it uses more digits than its factorization.
10663011143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9673 (or 8460 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 10663011143 its reverse (34111036601), we get a palindrome (44774047744).
The spelling of 10663011143 in words is "ten billion, six hundred sixty-three million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •