Base | Representation |
---|---|
bin | 100111101000111… |
… | …1101110100000101 |
3 | 10102200211120111021 |
4 | 1033101331310011 |
5 | 10211002002301 |
6 | 335552511141 |
7 | 44650513564 |
oct | 11721756405 |
9 | 3380746437 |
10 | 1330109701 |
11 | 6228a3118 |
12 | 31154b4b1 |
13 | 18274ab7b |
14 | c891bbdb |
15 | 7bb8b8a1 |
hex | 4f47dd05 |
1330109701 has 2 divisors, whose sum is σ = 1330109702. Its totient is φ = 1330109700.
The previous prime is 1330109689. The next prime is 1330109723. The reversal of 1330109701 is 1079010331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1312250625 + 17859076 = 36225^2 + 4226^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330109701 - 227 = 1195891973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330109731) 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, 665054850 + 665054851.
It is an arithmetic number, because the mean of its divisors is an integer number (665054851).
Almost surely, 21330109701 is an apocalyptic number.
It is an amenable number.
1330109701 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330109701 is an equidigital number, since it uses as much as digits as its factorization.
1330109701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 25.
The square root of 1330109701 is about 36470.6690506220. The cubic root of 1330109701 is about 1099.7546838625.
The spelling of 1330109701 in words is "one billion, three hundred thirty million, one hundred nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •