Base | Representation |
---|---|
bin | 1010000000101010010001… |
… | …1010100100011111101010 |
3 | 1102222012121110000110121122 |
4 | 2200022210122210133222 |
5 | 2420312214422003002 |
6 | 35224144451135242 |
7 | 2214122311550225 |
oct | 240124432443752 |
9 | 42865543013548 |
10 | 11006464641002 |
11 | 35638a7396426 |
12 | 12991628a4522 |
13 | 61ab9c84490c |
14 | 2a0a03d745bc |
15 | 141483ec36a2 |
hex | a02a46a47ea |
11006464641002 has 8 divisors (see below), whose sum is σ = 16509838581216. Its totient is φ = 5503185113932.
The previous prime is 11006464641001. The next prime is 11006464641023. The reversal of 11006464641002 is 20014646460011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110064646410022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11006464641001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23311118 + ... + 23778585.
It is an arithmetic number, because the mean of its divisors is an integer number (2063729822652).
Almost surely, 211006464641002 is an apocalyptic number.
11006464641002 is a deficient number, since it is larger than the sum of its proper divisors (5503373940214).
11006464641002 is a wasteful number, since it uses less digits than its factorization.
11006464641002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47206572.
The product of its (nonzero) digits is 27648, while the sum is 35.
The spelling of 11006464641002 in words is "eleven trillion, six billion, four hundred sixty-four million, six hundred forty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •