Base | Representation |
---|---|
bin | 100001011000011… |
… | …1101010001000001 |
3 | 2220001201111122111 |
4 | 1002300331101001 |
5 | 4243223130423 |
6 | 303052135321 |
7 | 36520643314 |
oct | 10260752101 |
9 | 2801644574 |
10 | 1120130113 |
11 | 525314373 |
12 | 273167541 |
13 | 14b0ab3ab |
14 | a8a9c97b |
15 | 6851060d |
hex | 42c3d441 |
1120130113 has 2 divisors, whose sum is σ = 1120130114. Its totient is φ = 1120130112.
The previous prime is 1120130093. The next prime is 1120130117. The reversal of 1120130113 is 3110310211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 866301489 + 253828624 = 29433^2 + 15932^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120130113 - 225 = 1086575681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120130093 and 1120130102.
It is not a weakly prime, because it can be changed into another prime (1120130117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560065056 + 560065057.
It is an arithmetic number, because the mean of its divisors is an integer number (560065057).
Almost surely, 21120130113 is an apocalyptic number.
It is an amenable number.
1120130113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120130113 is an equidigital number, since it uses as much as digits as its factorization.
1120130113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1120130113 is about 33468.3449396590. The cubic root of 1120130113 is about 1038.5390337526.
Adding to 1120130113 its reverse (3110310211), we get a palindrome (4230440324).
It can be divided in two parts, 11201 and 30113, that added together give a palindrome (41314).
The spelling of 1120130113 in words is "one billion, one hundred twenty million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •