Base | Representation |
---|---|
bin | 1010000010111111100000… |
… | …0011101000100010001110 |
3 | 1110010001000011011122102010 |
4 | 2200233320003220202032 |
5 | 2421441234242320141 |
6 | 35254411420442050 |
7 | 2220041062010154 |
oct | 240577003504216 |
9 | 43101004148363 |
10 | 11046522620046 |
11 | 3579893044a31 |
12 | 12a4a820a9326 |
13 | 6218b49172b4 |
14 | 2a29241153d4 |
15 | 14252ab0e416 |
hex | a0bf80e888e |
11046522620046 has 16 divisors (see below), whose sum is σ = 23392636136784. Its totient is φ = 3465575723904.
The previous prime is 11046522620041. The next prime is 11046522620069. The reversal of 11046522620046 is 64002622564011.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11046522619986 and 11046522620013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11046522620041) 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 7 ways as a sum of consecutive naturals, for example, 54149620585 + ... + 54149620788.
It is an arithmetic number, because the mean of its divisors is an integer number (1462039758549).
Almost surely, 211046522620046 is an apocalyptic number.
11046522620046 is an abundant number, since it is smaller than the sum of its proper divisors (12346113516738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11046522620046 is a wasteful number, since it uses less digits than its factorization.
11046522620046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108299241395.
The product of its (nonzero) digits is 138240, while the sum is 39.
The spelling of 11046522620046 in words is "eleven trillion, forty-six billion, five hundred twenty-two million, six hundred twenty thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •