Base | Representation |
---|---|
bin | 10011110011110100110… |
… | …001001111101010010011 |
3 | 11211010210110121221010111 |
4 | 103303310301033222103 |
5 | 134300433422343233 |
6 | 2521214030542151 |
7 | 200231453624032 |
oct | 23636461175223 |
9 | 4733713557114 |
10 | 1361316215443 |
11 | 485370572408 |
12 | 19b9ba067957 |
13 | 9b4aa449222 |
14 | 49c60b80719 |
15 | 25626ebcacd |
hex | 13cf4c4fa93 |
1361316215443 has 16 divisors (see below), whose sum is σ = 1455693374016. Its totient is φ = 1269895221760.
The previous prime is 1361316215437. The next prime is 1361316215449. The reversal of 1361316215443 is 3445126131631.
It is an interprime number because it is at equal distance from previous prime (1361316215437) and next prime (1361316215449).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1361316215443 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1361316215396 and 1361316215405.
It is not an unprimeable number, because it can be changed into a prime (1361316215449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2271471 + ... + 2807527.
It is an arithmetic number, because the mean of its divisors is an integer number (90980835876).
Almost surely, 21361316215443 is an apocalyptic number.
1361316215443 is a deficient number, since it is larger than the sum of its proper divisors (94377158573).
1361316215443 is a wasteful number, since it uses less digits than its factorization.
1361316215443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538814.
The product of its digits is 155520, while the sum is 40.
The spelling of 1361316215443 in words is "one trillion, three hundred sixty-one billion, three hundred sixteen million, two hundred fifteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •