Base | Representation |
---|---|
bin | 1010000001001101110010… |
… | …0010000111111001010100 |
3 | 1110000010012201002201110201 |
4 | 2200103130202013321110 |
5 | 2420441224444022300 |
6 | 35232402335030244 |
7 | 2214610436465233 |
oct | 240233442077124 |
9 | 43003181081421 |
10 | 11015996079700 |
11 | 3567948667397 |
12 | 129ab8296b384 |
13 | 61ba5b436a81 |
14 | 2a1269ba6b1a |
15 | 141840b7866a |
hex | a04dc887e54 |
11015996079700 has 18 divisors (see below), whose sum is σ = 23904711493166. Its totient is φ = 4406398431840.
The previous prime is 11015996079691. The next prime is 11015996079701. The reversal of 11015996079700 is 797069951011.
It can be written as a sum of positive squares in 3 ways, for example, as 260626586256 + 10755369493444 = 510516^2 + 3279538^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11015996079701) by changing a digit.
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, 55079980299 + ... + 55079980498.
Almost surely, 211015996079700 is an apocalyptic number.
11015996079700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11015996079700 is an abundant number, since it is smaller than the sum of its proper divisors (12888715413466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11015996079700 is a wasteful number, since it uses less digits than its factorization.
11015996079700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110159960811 (or 110159960804 counting only the distinct ones).
The product of its (nonzero) digits is 1071630, while the sum is 55.
The spelling of 11015996079700 in words is "eleven trillion, fifteen billion, nine hundred ninety-six million, seventy-nine thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •