Base | Representation |
---|---|
bin | 110100010011011001… |
… | …1100100011000111101 |
3 | 101201220210021110120122 |
4 | 1220212303210120331 |
5 | 3320012432433201 |
6 | 123333231424325 |
7 | 11054253652436 |
oct | 1504663443075 |
9 | 351823243518 |
10 | 112320202301 |
11 | 436a890a47a |
12 | 199279850a5 |
13 | a7900c6588 |
14 | 56173d048d |
15 | 2dc5b59e1b |
hex | 1a26ce463d |
112320202301 has 2 divisors, whose sum is σ = 112320202302. Its totient is φ = 112320202300.
The previous prime is 112320202279. The next prime is 112320202331. The reversal of 112320202301 is 103202023211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78023014276 + 34297188025 = 279326^2 + 185195^2 .
It is a cyclic number.
It is not a de Polignac number, because 112320202301 - 230 = 111246460477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112320202301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112320202331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56160101150 + 56160101151.
It is an arithmetic number, because the mean of its divisors is an integer number (56160101151).
Almost surely, 2112320202301 is an apocalyptic number.
It is an amenable number.
112320202301 is a deficient number, since it is larger than the sum of its proper divisors (1).
112320202301 is an equidigital number, since it uses as much as digits as its factorization.
112320202301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 112320202301 its reverse (103202023211), we get a palindrome (215522225512).
The spelling of 112320202301 in words is "one hundred twelve billion, three hundred twenty million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •