Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0000010111000000010000 |
3 | 1102222122022112110210120212 |
4 | 2200032302300113000100 |
5 | 2420401012022414412 |
6 | 35230214512023252 |
7 | 2214342564305003 |
oct | 240166260270020 |
9 | 42878275423525 |
10 | 11011000201232 |
11 | 3565814614a09 |
12 | 129a009831b28 |
13 | 61b4433bc175 |
14 | 2a0d1449953a |
15 | 14164c288222 |
hex | a03b2c17010 |
11011000201232 has 160 divisors (see below), whose sum is σ = 22492584382464. Its totient is φ = 5211833369600.
The previous prime is 11011000201231. The next prime is 11011000201283. The reversal of 11011000201232 is 23210200011011.
It is a super-2 number, since 2×110110002012322 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11011000201231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18758092043 + ... + 18758092629.
Almost surely, 211011000201232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011000201232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11246292191232).
11011000201232 is an abundant number, since it is smaller than the sum of its proper divisors (11481584181232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011000201232 is a wasteful number, since it uses less digits than its factorization.
11011000201232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1797 (or 1791 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11011000201232 its reverse (23210200011011), we get a palindrome (34221200212243).
The spelling of 11011000201232 in words is "eleven trillion, eleven billion, two hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •