Base | Representation |
---|---|
bin | 101000010001001000111… |
… | …1010111000111010001100 |
3 | 201121002011111001002012200 |
4 | 1100202101322320322030 |
5 | 1211133340144323040 |
6 | 15434241434401500 |
7 | 1110562514624460 |
oct | 120422172707214 |
9 | 21532144032180 |
10 | 5534366011020 |
11 | 1844125372760 |
12 | 75471bb90290 |
13 | 311b71c995b2 |
14 | 151c16c024a0 |
15 | 98e65401630 |
hex | 50891eb8e8c |
5534366011020 has 144 divisors (see below), whose sum is σ = 20929966057728. Its totient is φ = 1149998129280.
The previous prime is 5534366011001. The next prime is 5534366011037. The reversal of 5534366011020 is 201106634355.
5534366011020 is a `hidden beast` number, since 5 + 5 + 3 + 4 + 36 + 601 + 10 + 2 + 0 = 666.
It is a super-2 number, since 2×55343660110202 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 47 ways as a sum of consecutive naturals, for example, 199638594 + ... + 199666313.
It is an arithmetic number, because the mean of its divisors is an integer number (145346986512).
Almost surely, 25534366011020 is an apocalyptic number.
It is an amenable number.
5534366011020 is an abundant number, since it is smaller than the sum of its proper divisors (15395600046708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5534366011020 is a wasteful number, since it uses less digits than its factorization.
5534366011020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399304940 (or 399304935 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 5534366011020 in words is "five trillion, five hundred thirty-four billion, three hundred sixty-six million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •