Base | Representation |
---|---|
bin | 10000001011101000010… |
… | …111110100011000000001 |
3 | 10221022021012102001010112 |
4 | 100023220113310120001 |
5 | 121204334012322241 |
6 | 2210502405441105 |
7 | 143224254032036 |
oct | 20135027643001 |
9 | 3838235361115 |
10 | 1112000120321 |
11 | 399662095002 |
12 | 15b61a710195 |
13 | 80b26c8279c |
14 | 3bb6d11738d |
15 | 1ddd42471eb |
hex | 102e85f4601 |
1112000120321 has 2 divisors, whose sum is σ = 1112000120322. Its totient is φ = 1112000120320.
The previous prime is 1112000120317. The next prime is 1112000120327. The reversal of 1112000120321 is 1230210002111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 698788996096 + 413211124225 = 835936^2 + 642815^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112000120321 - 22 = 1112000120317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112000120296 and 1112000120305.
It is not a weakly prime, because it can be changed into another prime (1112000120327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556000060160 + 556000060161.
It is an arithmetic number, because the mean of its divisors is an integer number (556000060161).
Almost surely, 21112000120321 is an apocalyptic number.
It is an amenable number.
1112000120321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112000120321 is an equidigital number, since it uses as much as digits as its factorization.
1112000120321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1112000120321 its reverse (1230210002111), we get a palindrome (2342210122432).
It can be divided in two parts, 1112000 and 120321, that added together give a palindrome (1232321).
The spelling of 1112000120321 in words is "one trillion, one hundred twelve billion, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •