Base | Representation |
---|---|
bin | 110100010011011101… |
… | …0011110100000100101 |
3 | 101201220220200110200202 |
4 | 1220212322132200211 |
5 | 3320013413410341 |
6 | 123333334320245 |
7 | 11054305234205 |
oct | 1504672364045 |
9 | 351826613622 |
10 | 112322013221 |
11 | 436a9937000 |
12 | 199284b9085 |
13 | a7905ab922 |
14 | 5617742405 |
15 | 2dc5db679b |
hex | 1a26e9e825 |
112322013221 has 16 divisors (see below), whose sum is σ = 124639267968. Its totient is φ = 101207149120.
The previous prime is 112322013217. The next prime is 112322013263. The reversal of 112322013221 is 122310223211.
It is not a de Polignac number, because 112322013221 - 22 = 112322013217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112322013193 and 112322013202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112322013211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 223001 + ... + 523806.
It is an arithmetic number, because the mean of its divisors is an integer number (7789954248).
Almost surely, 2112322013221 is an apocalyptic number.
112322013221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112322013221 is a deficient number, since it is larger than the sum of its proper divisors (12317254747).
112322013221 is an equidigital number, since it uses as much as digits as its factorization.
112322013221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 746953 (or 746931 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112322013221 its reverse (122310223211), we get a palindrome (234632236432).
The spelling of 112322013221 in words is "one hundred twelve billion, three hundred twenty-two million, thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •