Base | Representation |
---|---|
bin | 1010000001001000101111… |
… | …0001000111100101000001 |
3 | 1102222222201021101101111011 |
4 | 2200102023301013211001 |
5 | 2420430441102243230 |
6 | 35232020052120521 |
7 | 2214532034125063 |
oct | 240221361074501 |
9 | 42888637341434 |
10 | 11014641056065 |
11 | 35673127a8049 |
12 | 129a865006141 |
13 | 61b8a37a4c3a |
14 | 2a117bc41733 |
15 | 1417b1c19e2a |
hex | a048bc47941 |
11014641056065 has 32 divisors (see below), whose sum is σ = 13481983097856. Its totient is φ = 8636483381760.
The previous prime is 11014641056053. The next prime is 11014641056113. The reversal of 11014641056065 is 56065014641011.
It is not a de Polignac number, because 11014641056065 - 213 = 11014641047873 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 288571612 + ... + 288609778.
It is an arithmetic number, because the mean of its divisors is an integer number (421311971808).
Almost surely, 211014641056065 is an apocalyptic number.
It is an amenable number.
11014641056065 is a deficient number, since it is larger than the sum of its proper divisors (2467342041791).
11014641056065 is a wasteful number, since it uses less digits than its factorization.
11014641056065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41569.
The product of its (nonzero) digits is 86400, while the sum is 40.
Adding to 11014641056065 its reverse (56065014641011), we get a palindrome (67079655697076).
The spelling of 11014641056065 in words is "eleven trillion, fourteen billion, six hundred forty-one million, fifty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •