Base | Representation |
---|---|
bin | 1010000100011101001011… |
… | …1111101001011101000000 |
3 | 1110012102220202120111202111 |
4 | 2201013102333221131000 |
5 | 2422344240134401031 |
6 | 35314131045425104 |
7 | 2221621214340154 |
oct | 241072277513500 |
9 | 43172822514674 |
10 | 11071670622016 |
11 | 3589518479034 |
12 | 12a992010b194 |
13 | 624091a00134 |
14 | 2a3c2bdc7064 |
15 | 142eed7b91b1 |
hex | a11d2fe9740 |
11071670622016 has 28 divisors (see below), whose sum is σ = 22235049369792. Its totient is φ = 5469138497408.
The previous prime is 11071670621981. The next prime is 11071670622017. The reversal of 11071670622016 is 61022607617011.
It is a self number, because there is not a number n which added to its sum of digits gives 11071670622016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11071670622017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1042132360 + ... + 1042142983.
It is an arithmetic number, because the mean of its divisors is an integer number (794108906064).
Almost surely, 211071670622016 is an apocalyptic number.
11071670622016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11071670622016 is an abundant number, since it is smaller than the sum of its proper divisors (11163378747776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11071670622016 is an equidigital number, since it uses as much as digits as its factorization.
11071670622016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2084275438 (or 2084275428 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 40.
The spelling of 11071670622016 in words is "eleven trillion, seventy-one billion, six hundred seventy million, six hundred twenty-two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •