Base | Representation |
---|---|
bin | 10010111101101101011… |
… | …111010111100000111101 |
3 | 11121120211002100111001201 |
4 | 102331231133113200331 |
5 | 132322434234430023 |
6 | 2434404244335501 |
7 | 163103544324355 |
oct | 22755537274075 |
9 | 4546732314051 |
10 | 1303212030013 |
11 | 462764241953 |
12 | 1906a30a4591 |
13 | 95b7a6b880a |
14 | 4710bdc5b65 |
15 | 23d75decbad |
hex | 12f6d7d783d |
1303212030013 has 4 divisors (see below), whose sum is σ = 1303240759708. Its totient is φ = 1303183300320.
The previous prime is 1303212029993. The next prime is 1303212030023. The reversal of 1303212030013 is 3100302123031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1098811290564 + 204400739449 = 1048242^2 + 452107^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1303212030013 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 (1303212030023) 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, 14296698 + ... + 14387563.
It is an arithmetic number, because the mean of its divisors is an integer number (325810189927).
Almost surely, 21303212030013 is an apocalyptic number.
It is an amenable number.
1303212030013 is a deficient number, since it is larger than the sum of its proper divisors (28729695).
1303212030013 is an equidigital number, since it uses as much as digits as its factorization.
1303212030013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28729694.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1303212030013 its reverse (3100302123031), we get a palindrome (4403514153044).
The spelling of 1303212030013 in words is "one trillion, three hundred three billion, two hundred twelve million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •