Base | Representation |
---|---|
bin | 10100100010010101… |
… | …00110111111011000 |
3 | 1001110101020222000200 |
4 | 22101022212333120 |
5 | 140040001141211 |
6 | 5022012502200 |
7 | 540135312321 |
oct | 122112467730 |
9 | 31411228020 |
10 | 11025412056 |
11 | 474861529a |
12 | 217847a960 |
13 | 1069284279 |
14 | 768407448 |
15 | 447e0db56 |
hex | 2912a6fd8 |
11025412056 has 24 divisors (see below), whose sum is σ = 29860491180. Its totient is φ = 3675137328.
The previous prime is 11025412037. The next prime is 11025412061. The reversal of 11025412056 is 65021452011.
11025412056 is a `hidden beast` number, since 110 + 2 + 541 + 2 + 0 + 5 + 6 = 666.
11025412056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×110254120562 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 76565290 + ... + 76565433.
Almost surely, 211025412056 is an apocalyptic number.
It is an amenable number.
11025412056 is an abundant number, since it is smaller than the sum of its proper divisors (18835079124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11025412056 is a wasteful number, since it uses less digits than its factorization.
11025412056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153130735 (or 153130728 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 11025412056 its reverse (65021452011), we get a palindrome (76046864067).
The spelling of 11025412056 in words is "eleven billion, twenty-five million, four hundred twelve thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •