Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011110010101010101100 |
3 | 1102222122022121011111210120 |
4 | 2200032302303302222230 |
5 | 2420401012240212342 |
6 | 35230214543204540 |
7 | 2214342605043105 |
oct | 240166263625254 |
9 | 42878277144716 |
10 | 11011001100972 |
11 | 35658150799a4 |
12 | 129a009ba6750 |
13 | 61b443645862 |
14 | 2a0d146513ac |
15 | 14164c3b4aec |
hex | a03b2cf2aac |
11011001100972 has 48 divisors (see below), whose sum is σ = 27220370728320. Its totient is φ = 3452308422912.
The previous prime is 11011001100971. The next prime is 11011001100977. The reversal of 11011001100972 is 27900110011011.
It is a super-2 number, since 2×110110011009722 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11011001100971) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16255522 + ... + 16919337.
It is an arithmetic number, because the mean of its divisors is an integer number (567091056840).
Almost surely, 211011001100972 is an apocalyptic number.
11011001100972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11011001100972 is an abundant number, since it is smaller than the sum of its proper divisors (16209369627348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011001100972 is a wasteful number, since it uses less digits than its factorization.
11011001100972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33176510 (or 33176508 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 24.
Adding to 11011001100972 its reverse (27900110011011), we get a palindrome (38911111111983).
The spelling of 11011001100972 in words is "eleven trillion, eleven billion, one million, one hundred thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •