Base | Representation |
---|---|
bin | 100111010101111… |
… | …0010010011111001 |
3 | 10102000000002021211 |
4 | 1032223302103321 |
5 | 10200421213423 |
6 | 334554203121 |
7 | 44466450202 |
oct | 11653622371 |
9 | 3360002254 |
10 | 1320101113 |
11 | 618187561 |
12 | 30a1234a1 |
13 | 180655426 |
14 | c74745a9 |
15 | 7ad6110d |
hex | 4eaf24f9 |
1320101113 has 2 divisors, whose sum is σ = 1320101114. Its totient is φ = 1320101112.
The previous prime is 1320101093. The next prime is 1320101131. The reversal of 1320101113 is 3111010231.
Together with next prime (1320101131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 929762064 + 390339049 = 30492^2 + 19757^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320101113 - 221 = 1318003961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320101093 and 1320101102.
It is not a weakly prime, because it can be changed into another prime (1320101213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660050556 + 660050557.
It is an arithmetic number, because the mean of its divisors is an integer number (660050557).
Almost surely, 21320101113 is an apocalyptic number.
It is an amenable number.
1320101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320101113 is an equidigital number, since it uses as much as digits as its factorization.
1320101113 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 1320101113 is about 36333.1957443878. The cubic root of 1320101113 is about 1096.9893191272.
Adding to 1320101113 its reverse (3111010231), we get a palindrome (4431111344).
The spelling of 1320101113 in words is "one billion, three hundred twenty million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •