Base | Representation |
---|---|
bin | 1010000000111000101001… |
… | …1101000101111110110111 |
3 | 1102222120120102012101010002 |
4 | 2200032022131011332313 |
5 | 2420343120424442020 |
6 | 35230023440021515 |
7 | 2214320044232666 |
oct | 240161235057667 |
9 | 42876512171102 |
10 | 11010324062135 |
11 | 35654a7992672 |
12 | 1299a5b30189b |
13 | 61b3662b5668 |
14 | 2a0c8c772ddd |
15 | 14160cc2a975 |
hex | a038a745fb7 |
11010324062135 has 16 divisors (see below), whose sum is σ = 13227759799200. Its totient is φ = 8798013154176.
The previous prime is 11010324062123. The next prime is 11010324062137. The reversal of 11010324062135 is 53126042301011.
It is a cyclic number.
It is not a de Polignac number, because 11010324062135 - 212 = 11010324058039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010324062098 and 11010324062107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010324062137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85506581 + ... + 85635249.
It is an arithmetic number, because the mean of its divisors is an integer number (826734987450).
Almost surely, 211010324062135 is an apocalyptic number.
11010324062135 is a deficient number, since it is larger than the sum of its proper divisors (2217435737065).
11010324062135 is a wasteful number, since it uses less digits than its factorization.
11010324062135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148450.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 11010324062135 its reverse (53126042301011), we get a palindrome (64136366363146).
The spelling of 11010324062135 in words is "eleven trillion, ten billion, three hundred twenty-four million, sixty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •