Base | Representation |
---|---|
bin | 1010000010001001110010… |
… | …1010001100100000111010 |
3 | 1110001122210022121021100020 |
4 | 2200202130222030200322 |
5 | 2421222222201320010 |
6 | 35244025002351310 |
7 | 2216020554343122 |
oct | 240423452144072 |
9 | 43048708537306 |
10 | 11032104323130 |
11 | 3573764314070 |
12 | 12a21194bb536 |
13 | 62042775b967 |
14 | 2a1d57273c82 |
15 | 141e84e01470 |
hex | a089ca8c83a |
11032104323130 has 64 divisors (see below), whose sum is σ = 29290872692736. Its totient is φ = 2636781224000.
The previous prime is 11032104323117. The next prime is 11032104323161. The reversal of 11032104323130 is 3132340123011.
It is a self number, because there is not a number n which added to its sum of digits gives 11032104323130.
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 31 ways as a sum of consecutive naturals, for example, 235403466 + ... + 235450325.
It is an arithmetic number, because the mean of its divisors is an integer number (457669885824).
Almost surely, 211032104323130 is an apocalyptic number.
11032104323130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11032104323130 is an abundant number, since it is smaller than the sum of its proper divisors (18258768369606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11032104323130 is a wasteful number, since it uses less digits than its factorization.
11032104323130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470853883.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11032104323130 its reverse (3132340123011), we get a palindrome (14164444446141).
The spelling of 11032104323130 in words is "eleven trillion, thirty-two billion, one hundred four million, three hundred twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •