Base | Representation |
---|---|
bin | 1010000001011100111011… |
… | …0100110011110110101111 |
3 | 1110000111201000002100110212 |
4 | 2200113032310303312233 |
5 | 2421023041113031443 |
6 | 35234313545453035 |
7 | 2215113246340232 |
oct | 240271664636657 |
9 | 43014630070425 |
10 | 11020061064623 |
11 | 35696441a6766 |
12 | 129b9181a117b |
13 | 61c25865c3b0 |
14 | 2a15339d5419 |
15 | 1419cc988618 |
hex | a05ced33daf |
11020061064623 has 16 divisors (see below), whose sum is σ = 11887680829920. Its totient is φ = 10155297027456.
The previous prime is 11020061064589. The next prime is 11020061064647. The reversal of 11020061064623 is 32646016002011.
It is a cyclic number.
It is not a de Polignac number, because 11020061064623 - 232 = 11015766097327 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11020061064623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020061064673) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27543161 + ... + 27940397.
It is an arithmetic number, because the mean of its divisors is an integer number (742980051870).
Almost surely, 211020061064623 is an apocalyptic number.
11020061064623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11020061064623 is a deficient number, since it is larger than the sum of its proper divisors (867619765297).
11020061064623 is a wasteful number, since it uses less digits than its factorization.
11020061064623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400826.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 11020061064623 its reverse (32646016002011), we get a palindrome (43666077066634).
The spelling of 11020061064623 in words is "eleven trillion, twenty billion, sixty-one million, sixty-four thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •