Base | Representation |
---|---|
bin | 1010000100011101001011… |
… | …1111101001011101000011 |
3 | 1110012102220202120111202121 |
4 | 2201013102333221131003 |
5 | 2422344240134401034 |
6 | 35314131045425111 |
7 | 2221621214340160 |
oct | 241072277513503 |
9 | 43172822514677 |
10 | 11071670622019 |
11 | 3589518479037 |
12 | 12a992010b197 |
13 | 624091a00137 |
14 | 2a3c2bdc7067 |
15 | 142eed7b91b4 |
hex | a11d2fe9743 |
11071670622019 has 8 divisors (see below), whose sum is σ = 12656913281280. Its totient is φ = 9487321819656.
The previous prime is 11071670622017. The next prime is 11071670622031. The reversal of 11071670622019 is 91022607617011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11071670622019 - 21 = 11071670622017 is a prime.
It is a super-2 number, since 2×110716706220192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11071670622017) 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, 223437679 + ... + 223487224.
It is an arithmetic number, because the mean of its divisors is an integer number (1582114160160).
Almost surely, 211071670622019 is an apocalyptic number.
11071670622019 is a deficient number, since it is larger than the sum of its proper divisors (1585242659261).
11071670622019 is an equidigital number, since it uses as much as digits as its factorization.
11071670622019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446928449.
The product of its (nonzero) digits is 63504, while the sum is 43.
The spelling of 11071670622019 in words is "eleven trillion, seventy-one billion, six hundred seventy million, six hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •