Base | Representation |
---|---|
bin | 110100010010110111… |
… | …0111010000111110101 |
3 | 101201212112102000200222 |
4 | 1220211232322013311 |
5 | 3314443331002011 |
6 | 123331345544125 |
7 | 11053644656444 |
oct | 1504556720765 |
9 | 351775360628 |
10 | 112302203381 |
11 | 43699736635 |
12 | 19921945045 |
13 | a789463c24 |
14 | 5614c66d5b |
15 | 2dc42a1ddb |
hex | 1a25bba1f5 |
112302203381 has 2 divisors, whose sum is σ = 112302203382. Its totient is φ = 112302203380.
The previous prime is 112302203333. The next prime is 112302203393. The reversal of 112302203381 is 183302203211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112057562500 + 244640881 = 334750^2 + 15641^2 .
It is a cyclic number.
It is not a de Polignac number, because 112302203381 - 210 = 112302202357 is a prime.
It is a super-2 number, since 2×1123022033812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112302203381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112302203081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56151101690 + 56151101691.
It is an arithmetic number, because the mean of its divisors is an integer number (56151101691).
Almost surely, 2112302203381 is an apocalyptic number.
It is an amenable number.
112302203381 is a deficient number, since it is larger than the sum of its proper divisors (1).
112302203381 is an equidigital number, since it uses as much as digits as its factorization.
112302203381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 112302203381 its reverse (183302203211), we get a palindrome (295604406592).
The spelling of 112302203381 in words is "one hundred twelve billion, three hundred two million, two hundred three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •