Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …100000000101010101100 |
3 | 10220021010201021102220112 |
4 | 100001132310000222230 |
5 | 121020024143222200 |
6 | 2201501152035152 |
7 | 142360225203233 |
oct | 20013664005254 |
9 | 3807121242815 |
10 | 1101102320300 |
11 | 394a7a610604 |
12 | 159498b32ab8 |
13 | 7caab28c0c8 |
14 | 3b417a4bb1a |
15 | 1d997644535 |
hex | 1005ed00aac |
1101102320300 has 72 divisors (see below), whose sum is σ = 2515772313600. Its totient is φ = 417156505920.
The previous prime is 1101102320261. The next prime is 1101102320309. The reversal of 1101102320300 is 30232011011.
It is not an unprimeable number, because it can be changed into a prime (1101102320309) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7832429 + ... + 7971771.
Almost surely, 21101102320300 is an apocalyptic number.
1101102320300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101102320300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1257886156800).
1101102320300 is an abundant number, since it is smaller than the sum of its proper divisors (1414669993300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101102320300 is a wasteful number, since it uses less digits than its factorization.
1101102320300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143535 (or 143528 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1101102320300 its reverse (30232011011), we get a palindrome (1131334331311).
The spelling of 1101102320300 in words is "one trillion, one hundred one billion, one hundred two million, three hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •