Base | Representation |
---|---|
bin | 11001110010001110000011… |
… | …000100000111100011100011 |
3 | 112212112010221201110222222102 |
4 | 121302032003010013203203 |
5 | 104330440221411123412 |
6 | 1041104132202401015 |
7 | 32613016511044505 |
oct | 3162160304074343 |
9 | 485463851428872 |
10 | 113402220411107 |
11 | 33151680039a71 |
12 | 1087613a20016b |
13 | 4b37a25469604 |
14 | 20009a7c6bd75 |
15 | d19cba74e8c2 |
hex | 6723831078e3 |
113402220411107 has 2 divisors, whose sum is σ = 113402220411108. Its totient is φ = 113402220411106.
The previous prime is 113402220411079. The next prime is 113402220411119. The reversal of 113402220411107 is 701114022204311.
It is a strong prime.
It is an emirp because it is prime and its reverse (701114022204311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113402220411107 - 212 = 113402220407011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113402220411107.
It is not a weakly prime, because it can be changed into another prime (113402220411167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56701110205553 + 56701110205554.
It is an arithmetic number, because the mean of its divisors is an integer number (56701110205554).
Almost surely, 2113402220411107 is an apocalyptic number.
113402220411107 is a deficient number, since it is larger than the sum of its proper divisors (1).
113402220411107 is an equidigital number, since it uses as much as digits as its factorization.
113402220411107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 29.
Adding to 113402220411107 its reverse (701114022204311), we get a palindrome (814516242615418).
The spelling of 113402220411107 in words is "one hundred thirteen trillion, four hundred two billion, two hundred twenty million, four hundred eleven thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •