Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0111010000101001001 |
3 | 101201002111011100012221 |
4 | 1220103232322011021 |
5 | 3313334023311241 |
6 | 123241401134041 |
7 | 11043320051113 |
oct | 1502356720511 |
9 | 351074140187 |
10 | 112000213321 |
11 | 43554222a77 |
12 | 1985878a321 |
13 | a73ba1a399 |
14 | 55c6ad63b3 |
15 | 2da79ed5d1 |
hex | 1a13bba149 |
112000213321 has 8 divisors (see below), whose sum is σ = 112662978120. Its totient is φ = 111337625472.
The previous prime is 112000213291. The next prime is 112000213333. The reversal of 112000213321 is 123312000211.
It can be written as a sum of positive squares in 4 ways, for example, as 37176081721 + 74824131600 = 192811^2 + 273540^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112000213321 - 221 = 111998116169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112000213295 and 112000213304.
It is not an unprimeable number, because it can be changed into a prime (112000211321) 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, 1355821 + ... + 1436053.
It is an arithmetic number, because the mean of its divisors is an integer number (14082872265).
Almost surely, 2112000213321 is an apocalyptic number.
It is an amenable number.
112000213321 is a deficient number, since it is larger than the sum of its proper divisors (662764799).
112000213321 is an equidigital number, since it uses as much as digits as its factorization.
112000213321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88475.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 112000213321 its reverse (123312000211), we get a palindrome (235312213532).
The spelling of 112000213321 in words is "one hundred twelve billion, two hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •