Base | Representation |
---|---|
bin | 10011101010010100101… |
… | …011101100001011101001 |
3 | 11210011110110202110110211 |
4 | 103222110223230023221 |
5 | 134114040214241243 |
6 | 2512405430341121 |
7 | 166420604212003 |
oct | 23522453541351 |
9 | 4704413673424 |
10 | 1351114212073 |
11 | 48100582726a |
12 | 199a314ba7a1 |
13 | 9a542952942 |
14 | 49573c77373 |
15 | 2522b50bd9d |
hex | 13a94aec2e9 |
1351114212073 has 4 divisors (see below), whose sum is σ = 1351136098180. Its totient is φ = 1351092325968.
The previous prime is 1351114212059. The next prime is 1351114212079. The reversal of 1351114212073 is 3702124111531.
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 1104743940624 + 246370271449 = 1051068^2 + 496357^2 .
It is a cyclic number.
It is not a de Polignac number, because 1351114212073 - 229 = 1350577341161 is a prime.
It is a super-2 number, since 2×13511142120732 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1351114212079) 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, 10850190 + ... + 10974007.
It is an arithmetic number, because the mean of its divisors is an integer number (337784024545).
Almost surely, 21351114212073 is an apocalyptic number.
It is an amenable number.
1351114212073 is a deficient number, since it is larger than the sum of its proper divisors (21886107).
1351114212073 is an equidigital number, since it uses as much as digits as its factorization.
1351114212073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21886106.
The product of its (nonzero) digits is 5040, while the sum is 31.
The spelling of 1351114212073 in words is "one trillion, three hundred fifty-one billion, one hundred fourteen million, two hundred twelve thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.253 sec. • engine limits •