Base | Representation |
---|---|
bin | 10101101110011000… |
… | …10101110010001001 |
3 | 1010002211202010001111 |
4 | 22313030111302021 |
5 | 142341312300243 |
6 | 5205203050321 |
7 | 562013156563 |
oct | 126714256211 |
9 | 33084663044 |
10 | 11663400073 |
11 | 4a4575a116 |
12 | 23160709a1 |
13 | 113b4c0980 |
14 | 7c903c333 |
15 | 483e3239d |
hex | 2b7315c89 |
11663400073 has 64 divisors (see below), whose sum is σ = 13899755520. Its totient is φ = 9699478272.
The previous prime is 11663400029. The next prime is 11663400083. The reversal of 11663400073 is 37000436611.
11663400073 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 11663400073 - 221 = 11661302921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11663400083) 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 63 ways as a sum of consecutive naturals, for example, 69840636 + ... + 69840802.
It is an arithmetic number, because the mean of its divisors is an integer number (217183680).
Almost surely, 211663400073 is an apocalyptic number.
11663400073 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11663400073 is a deficient number, since it is larger than the sum of its proper divisors (2236355447).
11663400073 is a wasteful number, since it uses less digits than its factorization.
11663400073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 11663400073 its reverse (37000436611), we get a palindrome (48663836684).
The spelling of 11663400073 in words is "eleven billion, six hundred sixty-three million, four hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •