Base | Representation |
---|---|
bin | 10011001001101011011… |
… | …111101000010010001001 |
3 | 11122210222201120001210021 |
4 | 103021223133220102021 |
5 | 133030244220234103 |
6 | 2444331411020441 |
7 | 164040164501041 |
oct | 23115337502211 |
9 | 4583881501707 |
10 | 1316063446153 |
11 | 468159562025 |
12 | 19308ab9a721 |
13 | 97148066071 |
14 | 479aab14721 |
15 | 2437929ebbd |
hex | 1326b7e8489 |
1316063446153 has 4 divisors (see below), whose sum is σ = 1316289540868. Its totient is φ = 1315837351440.
The previous prime is 1316063446141. The next prime is 1316063446177. The reversal of 1316063446153 is 3516443606131.
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 1195604472969 + 120458973184 = 1093437^2 + 347072^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1316063446153 is a prime.
It is a super-2 number, since 2×13160634461532 (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 (1316063446123) 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, 113038626 + ... + 113050267.
It is an arithmetic number, because the mean of its divisors is an integer number (329072385217).
Almost surely, 21316063446153 is an apocalyptic number.
It is an amenable number.
1316063446153 is a deficient number, since it is larger than the sum of its proper divisors (226094715).
1316063446153 is an equidigital number, since it uses as much as digits as its factorization.
1316063446153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226094714.
The product of its (nonzero) digits is 466560, while the sum is 43.
The spelling of 1316063446153 in words is "one trillion, three hundred sixteen billion, sixty-three million, four hundred forty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •