Base | Representation |
---|---|
bin | 10000000000101001001… |
… | …101011100111110110101 |
3 | 10220011211001002021002220 |
4 | 100000221031130332311 |
5 | 121011203433121323 |
6 | 2201232024552553 |
7 | 142326025241133 |
oct | 20005115347665 |
9 | 3804731067086 |
10 | 1100203020213 |
11 | 394658a170a0 |
12 | 159287922759 |
13 | 7c996b7c18b |
14 | 3b370434753 |
15 | 1d9437050e3 |
hex | 1002935cfb5 |
1100203020213 has 8 divisors (see below), whose sum is σ = 1600295302176. Its totient is φ = 666789709200.
The previous prime is 1100203020209. The next prime is 1100203020221. The reversal of 1100203020213 is 3120203020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100203020213 - 22 = 1100203020209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100203020192 and 1100203020201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100203020113) 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 7 ways as a sum of consecutive naturals, for example, 16669742698 + ... + 16669742763.
It is an arithmetic number, because the mean of its divisors is an integer number (200036912772).
Almost surely, 21100203020213 is an apocalyptic number.
It is an amenable number.
1100203020213 is a deficient number, since it is larger than the sum of its proper divisors (500092281963).
1100203020213 is a wasteful number, since it uses less digits than its factorization.
1100203020213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33339485475.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1100203020213 its reverse (3120203020011), we get a palindrome (4220406040224).
The spelling of 1100203020213 in words is "one trillion, one hundred billion, two hundred three million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •