Base | Representation |
---|---|
bin | 11001011101110110001011… |
… | …111100100111011111010001 |
3 | 112200120022021121002101222012 |
4 | 121131312023330213133101 |
5 | 104140021011241214301 |
6 | 1034113034402552305 |
7 | 32406615114544430 |
oct | 3135661374473721 |
9 | 480508247071865 |
10 | 112002210101201 |
11 | 3276196378a7a2 |
12 | 1068a941668695 |
13 | 4a659bc692b04 |
14 | 1d92d1613b117 |
15 | ce367b754ebb |
hex | 65dd8bf277d1 |
112002210101201 has 8 divisors (see below), whose sum is σ = 128002600154304. Its totient is φ = 96001838629200.
The previous prime is 112002210101191. The next prime is 112002210101203. The reversal of 112002210101201 is 102101012200211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112002210101201 - 222 = 112002205906897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112002210101203) 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, 12480551 + ... + 19487651.
It is an arithmetic number, because the mean of its divisors is an integer number (16000325019288).
Almost surely, 2112002210101201 is an apocalyptic number.
It is an amenable number.
112002210101201 is a deficient number, since it is larger than the sum of its proper divisors (16000390053103).
112002210101201 is an equidigital number, since it uses as much as digits as its factorization.
112002210101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9290551.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112002210101201 its reverse (102101012200211), we get a palindrome (214103222301412).
The spelling of 112002210101201 in words is "one hundred twelve trillion, two billion, two hundred ten million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.403 sec. • engine limits •