Base | Representation |
---|---|
bin | 1010000010110011101001… |
… | …1011011111001101011000 |
3 | 1110002201210102202212122220 |
4 | 2200230322123133031120 |
5 | 2421413230321433024 |
6 | 35253124011544040 |
7 | 2216566201262520 |
oct | 240547233371530 |
9 | 43081712685586 |
10 | 11043341202264 |
11 | 3578500233738 |
12 | 12a433475b020 |
13 | 6214c8783777 |
14 | 2a27017a6680 |
15 | 1423e1681e79 |
hex | a0b3a6df358 |
11043341202264 has 128 divisors (see below), whose sum is σ = 31607145699840. Its totient is φ = 3149768143872.
The previous prime is 11043341202253. The next prime is 11043341202293. The reversal of 11043341202264 is 46220214334011.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 903186919 + ... + 903199145.
It is an arithmetic number, because the mean of its divisors is an integer number (246930825780).
Almost surely, 211043341202264 is an apocalyptic number.
11043341202264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11043341202264 is an abundant number, since it is smaller than the sum of its proper divisors (20563804497576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11043341202264 is a wasteful number, since it uses less digits than its factorization.
11043341202264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21129 (or 21125 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 11043341202264 its reverse (46220214334011), we get a palindrome (57263555536275).
The spelling of 11043341202264 in words is "eleven trillion, forty-three billion, three hundred forty-one million, two hundred two thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •