Base | Representation |
---|---|
bin | 1010000011010010000011… |
… | …0110111101010101100101 |
3 | 1110010111212011222222122110 |
4 | 2200310200312331111211 |
5 | 2422031434021134113 |
6 | 35300553500551233 |
7 | 2220305345106354 |
oct | 240644066752545 |
9 | 43114764888573 |
10 | 11051502130533 |
11 | 3580a08927957 |
12 | 12a5a31852519 |
13 | 6221c94509c7 |
14 | 2a2c775a199b |
15 | 14271cd69bc3 |
hex | a0d20dbd565 |
11051502130533 has 8 divisors (see below), whose sum is σ = 14736229669728. Its totient is φ = 7367221339184.
The previous prime is 11051502130477. The next prime is 11051502130561. The reversal of 11051502130533 is 33503120515011.
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 11051502130533 - 210 = 11051502129509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11051502130533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051502130583) 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, 111629235 + ... + 111728192.
It is an arithmetic number, because the mean of its divisors is an integer number (1842028708716).
Almost surely, 211051502130533 is an apocalyptic number.
It is an amenable number.
11051502130533 is a deficient number, since it is larger than the sum of its proper divisors (3684727539195).
11051502130533 is a wasteful number, since it uses less digits than its factorization.
11051502130533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223373923.
The product of its (nonzero) digits is 6750, while the sum is 30.
Adding to 11051502130533 its reverse (33503120515011), we get a palindrome (44554622645544).
The spelling of 11051502130533 in words is "eleven trillion, fifty-one billion, five hundred two million, one hundred thirty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •