Base | Representation |
---|---|
bin | 1010010100101110100101… |
… | …1111110101000011000110 |
3 | 1111012011111002222200110211 |
4 | 2211023221133311003012 |
5 | 2441434300040443420 |
6 | 40050402353110034 |
7 | 2251045560532132 |
oct | 245135137650306 |
9 | 44164432880424 |
10 | 11351221031110 |
11 | 3687031389a84 |
12 | 1333b38b5831a |
13 | 644552c6b69c |
14 | 2b358b2503c2 |
15 | 14a4109eee5a |
hex | a52e97f50c6 |
11351221031110 has 16 divisors (see below), whose sum is σ = 20678368916016. Its totient is φ = 4485783732448.
The previous prime is 11351221031081. The next prime is 11351221031113. The reversal of 11351221031110 is 1113012215311.
It is a super-2 number, since 2×113512210311102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11351221031113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6838084129 + ... + 6838085788.
It is an arithmetic number, because the mean of its divisors is an integer number (1292398057251).
Almost surely, 211351221031110 is an apocalyptic number.
11351221031110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11351221031110 is a deficient number, since it is larger than the sum of its proper divisors (9327147884906).
11351221031110 is a wasteful number, since it uses less digits than its factorization.
11351221031110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13676170007.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 11351221031110 its reverse (1113012215311), we get a palindrome (12464233246421).
The spelling of 11351221031110 in words is "eleven trillion, three hundred fifty-one billion, two hundred twenty-one million, thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.405 sec. • engine limits •