Base | Representation |
---|---|
bin | 11001011111010001010001… |
… | …110111110001100110111010 |
3 | 112200220122202010200010211102 |
4 | 121133101101313301212322 |
5 | 104143121320110014320 |
6 | 1034230012132331402 |
7 | 32416646666145653 |
oct | 3137212167614672 |
9 | 480818663603742 |
10 | 112100020001210 |
11 | 3279a3959382aa |
12 | 106a5899a73b62 |
13 | 4a71ca95290a7 |
14 | 1d9795437a52a |
15 | ce5ea357b175 |
hex | 65f451df19ba |
112100020001210 has 16 divisors (see below), whose sum is σ = 202668934843296. Its totient is φ = 44642474924688.
The previous prime is 112100020001209. The next prime is 112100020001213. The reversal of 112100020001210 is 12100020001211.
It is a junction number, because it is equal to n+sod(n) for n = 112100020001191 and 112100020001200.
It is not an unprimeable number, because it can be changed into a prime (112100020001213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24691632092 + ... + 24691636631.
It is an arithmetic number, because the mean of its divisors is an integer number (12666808427706).
Almost surely, 2112100020001210 is an apocalyptic number.
112100020001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112100020001210 is a deficient number, since it is larger than the sum of its proper divisors (90568914842086).
112100020001210 is a wasteful number, since it uses less digits than its factorization.
112100020001210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49383268957.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112100020001210 its reverse (12100020001211), we get a palindrome (124200040002421).
Subtracting from 112100020001210 its reverse (12100020001211), we obtain a palindrome (99999999999999).
The spelling of 112100020001210 in words is "one hundred twelve trillion, one hundred billion, twenty million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •