Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …000100000010010101001 |
3 | 10221022021012202011212202 |
4 | 100023220120200102221 |
5 | 121204334034101301 |
6 | 2210502413345545 |
7 | 143224255411340 |
oct | 20135030402251 |
9 | 3838235664782 |
10 | 1112000300201 |
11 | 3996621a816a |
12 | 15b61a7982b5 |
13 | 80b2701661b |
14 | 3bb6d162b57 |
15 | 1ddd428066b |
hex | 102e86204a9 |
1112000300201 has 4 divisors (see below), whose sum is σ = 1270857485952. Its totient is φ = 953143114452.
The previous prime is 1112000300107. The next prime is 1112000300221. The reversal of 1112000300201 is 1020030002111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112000300201 is a prime.
It is a super-2 number, since 2×11120003002012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1112000300221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79428592865 + ... + 79428592878.
It is an arithmetic number, because the mean of its divisors is an integer number (317714371488).
Almost surely, 21112000300201 is an apocalyptic number.
It is an amenable number.
1112000300201 is a deficient number, since it is larger than the sum of its proper divisors (158857185751).
1112000300201 is an equidigital number, since it uses as much as digits as its factorization.
1112000300201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158857185750.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1112000300201 its reverse (1020030002111), we get a palindrome (2132030302312).
The spelling of 1112000300201 in words is "one trillion, one hundred twelve billion, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •