Base | Representation |
---|---|
bin | 1010000010111011000000… |
… | …0110110110000111011000 |
3 | 1110002220220000202201111210 |
4 | 2200232300012312013120 |
5 | 2421431301232040202 |
6 | 35254051540023120 |
7 | 2216666133456162 |
oct | 240566006660730 |
9 | 43086800681453 |
10 | 11045315502552 |
11 | 3579323717771 |
12 | 12a47a5991aa0 |
13 | 6217518002a6 |
14 | 2a284ba91932 |
15 | 1424a9b69c6c |
hex | a0bb01b61d8 |
11045315502552 has 64 divisors (see below), whose sum is σ = 27975168050400. Its totient is φ = 3633674204160.
The previous prime is 11045315502547. The next prime is 11045315502583. The reversal of 11045315502552 is 25520551354011.
It is a self number, because there is not a number n which added to its sum of digits gives 11045315502552.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3623563 + ... + 5934714.
Almost surely, 211045315502552 is an apocalyptic number.
11045315502552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11045315502552 is an abundant number, since it is smaller than the sum of its proper divisors (16929852547848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11045315502552 is a wasteful number, since it uses less digits than its factorization.
11045315502552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9558916 (or 9558912 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 39.
Adding to 11045315502552 its reverse (25520551354011), we get a palindrome (36565866856563).
The spelling of 11045315502552 in words is "eleven trillion, forty-five billion, three hundred fifteen million, five hundred two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.978 sec. • engine limits •