Base | Representation |
---|---|
bin | 1010000000010010010100… |
… | …1011100011011011111101 |
3 | 1102221121000100120102111202 |
4 | 2200010211023203123331 |
5 | 2420211032431441111 |
6 | 35221202450225245 |
7 | 2213504060014016 |
oct | 240044513433375 |
9 | 42847010512452 |
10 | 11000035030781 |
11 | 35610a8006075 |
12 | 1297a69585225 |
13 | 61a3b676ab24 |
14 | 2a059409400d |
15 | 1412097c8b3b |
hex | a01252e36fd |
11000035030781 has 8 divisors (see below), whose sum is σ = 11073067102944. Its totient is φ = 10927176639120.
The previous prime is 11000035030759. The next prime is 11000035030801. The reversal of 11000035030781 is 18703053000011.
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 11000035030781 - 218 = 11000034768637 is a prime.
It is a super-2 number, since 2×110000350307812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000035030711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43293035 + ... + 43546376.
It is an arithmetic number, because the mean of its divisors is an integer number (1384133387868).
Almost surely, 211000035030781 is an apocalyptic number.
It is an amenable number.
11000035030781 is a deficient number, since it is larger than the sum of its proper divisors (73032072163).
11000035030781 is an equidigital number, since it uses as much as digits as its factorization.
11000035030781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86840251.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 11000035030781 its reverse (18703053000011), we get a palindrome (29703088030792).
The spelling of 11000035030781 in words is "eleven trillion, thirty-five million, thirty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •