Base | Representation |
---|---|
bin | 1010000010100111010100… |
… | …0100010101100111010100 |
3 | 1110002102020200012111101112 |
4 | 2200221311010111213110 |
5 | 2421334440141201400 |
6 | 35251415245514152 |
7 | 2216421143564162 |
oct | 240516504254724 |
9 | 43072220174345 |
10 | 11040030022100 |
11 | 3577061153002 |
12 | 12a376b872958 |
13 | 6210bb788671 |
14 | 2a24a9b1a232 |
15 | 14229ab21835 |
hex | a0a751159d4 |
11040030022100 has 18 divisors (see below), whose sum is σ = 23956865148174. Its totient is φ = 4416012008800.
The previous prime is 11040030022097. The next prime is 11040030022111. The reversal of 11040030022100 is 122003004011.
It can be written as a sum of positive squares in 3 ways, for example, as 1089677103376 + 9950352918724 = 1043876^2 + 3154418^2 .
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 5 ways as a sum of consecutive naturals, for example, 55200150011 + ... + 55200150210.
Almost surely, 211040030022100 is an apocalyptic number.
11040030022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11040030022100 is an abundant number, since it is smaller than the sum of its proper divisors (12916835126074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11040030022100 is a wasteful number, since it uses less digits than its factorization.
11040030022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110400300235 (or 110400300228 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11040030022100 its reverse (122003004011), we get a palindrome (11162033026111).
The spelling of 11040030022100 in words is "eleven trillion, forty billion, thirty million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.260 sec. • engine limits •