Base | Representation |
---|---|
bin | 110100010100000101… |
… | …1110101010100001101 |
3 | 101201222101210222221121 |
4 | 1220220023311110031 |
5 | 3320034343342201 |
6 | 123335415400541 |
7 | 11054654431243 |
oct | 1505013652415 |
9 | 351871728847 |
10 | 112343340301 |
11 | 4370a983395 |
12 | 19933683151 |
13 | a794b380ba |
14 | 561a4d4793 |
15 | 2dc7bca9a1 |
hex | 1a282f550d |
112343340301 has 2 divisors, whose sum is σ = 112343340302. Its totient is φ = 112343340300.
The previous prime is 112343340287. The next prime is 112343340349. The reversal of 112343340301 is 103043343211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75927251401 + 36416088900 = 275549^2 + 190830^2 .
It is a cyclic number.
It is not a de Polignac number, because 112343340301 - 223 = 112334951693 is a prime.
It is a super-2 number, since 2×1123433403012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112343340601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56171670150 + 56171670151.
It is an arithmetic number, because the mean of its divisors is an integer number (56171670151).
Almost surely, 2112343340301 is an apocalyptic number.
It is an amenable number.
112343340301 is a deficient number, since it is larger than the sum of its proper divisors (1).
112343340301 is an equidigital number, since it uses as much as digits as its factorization.
112343340301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 112343340301 its reverse (103043343211), we get a palindrome (215386683512).
The spelling of 112343340301 in words is "one hundred twelve billion, three hundred forty-three million, three hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •