Base | Representation |
---|---|
bin | 100110110010000… |
… | …1011100100100101 |
3 | 10100200200102110022 |
4 | 1031210023210211 |
5 | 10131120031323 |
6 | 333044004525 |
7 | 44151060431 |
oct | 11544134445 |
9 | 3320612408 |
10 | 1301330213 |
11 | 608626717 |
12 | 303990745 |
13 | 1797b25a1 |
14 | c4b899c1 |
15 | 793a44c8 |
hex | 4d90b925 |
1301330213 has 4 divisors (see below), whose sum is σ = 1320753120. Its totient is φ = 1281907308.
The previous prime is 1301330209. The next prime is 1301330237. The reversal of 1301330213 is 3120331031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1301330213 - 22 = 1301330209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1301330191 and 1301330200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301330203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9711353 + ... + 9711486.
It is an arithmetic number, because the mean of its divisors is an integer number (330188280).
Almost surely, 21301330213 is an apocalyptic number.
It is an amenable number.
1301330213 is a deficient number, since it is larger than the sum of its proper divisors (19422907).
1301330213 is an equidigital number, since it uses as much as digits as its factorization.
1301330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19422906.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1301330213 is about 36073.9547734927. The cubic root of 1301330213 is about 1091.7650087296.
Adding to 1301330213 its reverse (3120331031), we get a palindrome (4421661244).
The spelling of 1301330213 in words is "one billion, three hundred one million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •