Base | Representation |
---|---|
bin | 1010000001001000101000… |
… | …1010110001011010000001 |
3 | 1102222222122101220022022211 |
4 | 2200102022022301122001 |
5 | 2420430412220222221 |
6 | 35232013253102121 |
7 | 2214531260103001 |
oct | 240221212613201 |
9 | 42888571808284 |
10 | 11014614226561 |
11 | 35672a9642700 |
12 | 129a858027941 |
13 | 61b89b0700aa |
14 | 2a117845a001 |
15 | 1417ae6ba6e1 |
hex | a048a2b1681 |
11014614226561 has 6 divisors (see below), whose sum is σ = 12106972662386. Its totient is φ = 10013285660400.
The previous prime is 11014614226523. The next prime is 11014614226597. The reversal of 11014614226561 is 16562241641011.
It can be written as a sum of positive squares in only one way, i.e., 9046373582961 + 1968240643600 = 3007719^2 + 1402940^2 .
It is not a de Polignac number, because 11014614226561 - 27 = 11014614226433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014614226361) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 45514934700 + ... + 45514934941.
Almost surely, 211014614226561 is an apocalyptic number.
11014614226561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11014614226561 is a deficient number, since it is larger than the sum of its proper divisors (1092358435825).
11014614226561 is an equidigital number, since it uses as much as digits as its factorization.
11014614226561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91029869663 (or 91029869652 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 40.
Adding to 11014614226561 its reverse (16562241641011), we get a palindrome (27576855867572).
The spelling of 11014614226561 in words is "eleven trillion, fourteen billion, six hundred fourteen million, two hundred twenty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •