Base | Representation |
---|---|
bin | 1010000000101010111101… |
… | …1111110000100101010010 |
3 | 1102222020002101211122122200 |
4 | 2200022233133300211102 |
5 | 2420313110020104420 |
6 | 35224215131544030 |
7 | 2214130030010601 |
oct | 240125737604522 |
9 | 42866071748580 |
10 | 11006650550610 |
11 | 3563992325030 |
12 | 12991b4bbb016 |
13 | 61abcc2075c0 |
14 | 2a0a20929a38 |
15 | 141495497b90 |
hex | a02af7f0952 |
11006650550610 has 96 divisors (see below), whose sum is σ = 33620314448448. Its totient is φ = 2463026693760.
The previous prime is 11006650550591. The next prime is 11006650550677. The reversal of 11006650550610 is 1605505660011.
It is a super-2 number, since 2×110066505506102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 427595932 + ... + 427621671.
It is an arithmetic number, because the mean of its divisors is an integer number (350211608838).
Almost surely, 211006650550610 is an apocalyptic number.
11006650550610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11006650550610 is an abundant number, since it is smaller than the sum of its proper divisors (22613663897838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11006650550610 is a wasteful number, since it uses less digits than its factorization.
11006650550610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855217640 (or 855217637 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 11006650550610 in words is "eleven trillion, six billion, six hundred fifty million, five hundred fifty thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •