Base | Representation |
---|---|
bin | 1010000010110010100000… |
… | …0100111100100001011011 |
3 | 1110002200222222101222110022 |
4 | 2200230220010330201123 |
5 | 2421412113011200011 |
6 | 35253033252341055 |
7 | 2216555442213434 |
oct | 240545004744133 |
9 | 43080888358408 |
10 | 11043033303131 |
11 | 3578362454545 |
12 | 12a426961478b |
13 | 621479a4b42b |
14 | 2a26b293848b |
15 | 1423c46128db |
hex | a0b2813c85b |
11043033303131 has 16 divisors (see below), whose sum is σ = 11267664317280. Its totient is φ = 10819011989760.
The previous prime is 11043033303119. The next prime is 11043033303193. The reversal of 11043033303131 is 13130333034011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11043033303131 is a prime.
It is a super-2 number, since 2×110430333031312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11043033303131.
It is not an unprimeable number, because it can be changed into a prime (11043032303131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175424660 + ... + 175487598.
It is an arithmetic number, because the mean of its divisors is an integer number (704229019830).
Almost surely, 211043033303131 is an apocalyptic number.
11043033303131 is a deficient number, since it is larger than the sum of its proper divisors (224631014149).
11043033303131 is an equidigital number, since it uses as much as digits as its factorization.
11043033303131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67726.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 11043033303131 its reverse (13130333034011), we get a palindrome (24173366337142).
The spelling of 11043033303131 in words is "eleven trillion, forty-three billion, thirty-three million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •