Base | Representation |
---|---|
bin | 100111001000100… |
… | …0101010110011101 |
3 | 10101111211110020021 |
4 | 1032101011112131 |
5 | 10142123214323 |
6 | 334144152141 |
7 | 44353114264 |
oct | 11621052635 |
9 | 3344743207 |
10 | 1313101213 |
11 | 614236416 |
12 | 307908651 |
13 | 17c074288 |
14 | c65715db |
15 | 7a42c05d |
hex | 4e44559d |
1313101213 has 4 divisors (see below), whose sum is σ = 1316566240. Its totient is φ = 1309636188.
The previous prime is 1313101159. The next prime is 1313101217. The reversal of 1313101213 is 3121013131.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3121013131 = 19 ⋅164263849.
It is a cyclic number.
It is not a de Polignac number, because 1313101213 - 221 = 1311004061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313101217) 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, 1731945 + ... + 1732702.
It is an arithmetic number, because the mean of its divisors is an integer number (329141560).
Almost surely, 21313101213 is an apocalyptic number.
It is an amenable number.
1313101213 is a deficient number, since it is larger than the sum of its proper divisors (3465027).
1313101213 is an equidigital number, since it uses as much as digits as its factorization.
1313101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3465026.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1313101213 is about 36236.7384431877. The cubic root of 1313101213 is about 1095.0469355694.
Adding to 1313101213 its reverse (3121013131), we get a palindrome (4434114344).
The spelling of 1313101213 in words is "one billion, three hundred thirteen million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •