Base | Representation |
---|---|
bin | 101101011011010001100… |
… | …1111000111110010010001 |
3 | 211002212010010120202022221 |
4 | 1122312203033013302101 |
5 | 1304242312442200340 |
6 | 21140051110301041 |
7 | 1213031304335002 |
oct | 132664317076221 |
9 | 24085103522287 |
10 | 6243326131345 |
11 | 1a97863924376 |
12 | 849bb9357781 |
13 | 363987862984 |
14 | 1782700db1a9 |
15 | ac60ae0944a |
hex | 5ada33c7c91 |
6243326131345 has 4 divisors (see below), whose sum is σ = 7491991357620. Its totient is φ = 4994660905072.
The previous prime is 6243326131213. The next prime is 6243326131349. The reversal of 6243326131345 is 5431316233426.
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 3172844437504 + 3070481693841 = 1781248^2 + 1752279^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6243326131345 is a prime.
It is not an unprimeable number, because it can be changed into a prime (6243326131349) 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 3 ways as a sum of consecutive naturals, for example, 624332613130 + ... + 624332613139.
It is an arithmetic number, because the mean of its divisors is an integer number (1872997839405).
Almost surely, 26243326131345 is an apocalyptic number.
It is an amenable number.
6243326131345 is a deficient number, since it is larger than the sum of its proper divisors (1248665226275).
6243326131345 is a wasteful number, since it uses less digits than its factorization.
6243326131345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248665226274.
The product of its digits is 933120, while the sum is 43.
The spelling of 6243326131345 in words is "six trillion, two hundred forty-three billion, three hundred twenty-six million, one hundred thirty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •