Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …110011101001110001111 |
3 | 10220020212121010020201001 |
4 | 100001120232131032033 |
5 | 121014322022413403 |
6 | 2201443103201131 |
7 | 142354545203515 |
oct | 20013056351617 |
9 | 3806777106631 |
10 | 1101000201103 |
11 | 394a27a01980 |
12 | 15946a8a61a7 |
13 | 7ca93085b4a |
14 | 3b4082684b5 |
15 | 1d98d6c1c1d |
hex | 10058b9d38f |
1101000201103 has 8 divisors (see below), whose sum is σ = 1253312482176. Its totient is φ = 957391479000.
The previous prime is 1101000201101. The next prime is 1101000201107. The reversal of 1101000201103 is 3011020001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101000201103 - 21 = 1101000201101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101000201103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101000201101) 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, 2175889473 + ... + 2175889978.
It is an arithmetic number, because the mean of its divisors is an integer number (156664060272).
Almost surely, 21101000201103 is an apocalyptic number.
1101000201103 is a deficient number, since it is larger than the sum of its proper divisors (152312281073).
1101000201103 is a wasteful number, since it uses less digits than its factorization.
1101000201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4351779485.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1101000201103 its reverse (3011020001011), we get a palindrome (4112020202114).
The spelling of 1101000201103 in words is "one trillion, one hundred one billion, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •