Base | Representation |
---|---|
bin | 101101101110101100100001… |
… | …110001001011111111100111 |
3 | 222101002222110022010001102220 |
4 | 231232230201301023333213 |
5 | 202330131302012041403 |
6 | 1551425413440203423 |
7 | 60235340605124631 |
oct | 5556544161137747 |
9 | 871088408101386 |
10 | 201121000112103 |
11 | 590a0a34393395 |
12 | 1a682720009573 |
13 | 882b8239bac96 |
14 | 379444614da51 |
15 | 183b9434b0953 |
hex | b6eb21c4bfe7 |
201121000112103 has 8 divisors (see below), whose sum is σ = 271555780742400. Its totient is φ = 132383443111608.
The previous prime is 201121000112009. The next prime is 201121000112107. The reversal of 201121000112103 is 301211000121102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201121000112103 - 216 = 201121000046567 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121000112107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 424305907173 + ... + 424305907646.
It is an arithmetic number, because the mean of its divisors is an integer number (33944472592800).
Almost surely, 2201121000112103 is an apocalyptic number.
201121000112103 is a deficient number, since it is larger than the sum of its proper divisors (70434780630297).
201121000112103 is an equidigital number, since it uses as much as digits as its factorization.
201121000112103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848611814901.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 201121000112103 its reverse (301211000121102), we get a palindrome (502332000233205).
The spelling of 201121000112103 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •