Base | Representation |
---|---|
bin | 101110001010011101101… |
… | …0010111010110000101101 |
3 | 211110112200100222102101021 |
4 | 1130110323102322300231 |
5 | 1312422331321324323 |
6 | 21254410335214141 |
7 | 1223246425010164 |
oct | 134247322726055 |
9 | 24415610872337 |
10 | 6344661511213 |
11 | 20268350220a3 |
12 | 86577a377351 |
13 | 3703b6c16ccc |
14 | 17d12464c3db |
15 | b008c4c205d |
hex | 5c53b4bac2d |
6344661511213 has 2 divisors, whose sum is σ = 6344661511214. Its totient is φ = 6344661511212.
The previous prime is 6344661511189. The next prime is 6344661511241. The reversal of 6344661511213 is 3121151664436.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4347066541444 + 1997594969769 = 2084962^2 + 1413363^2 .
It is a cyclic number.
It is not a de Polignac number, because 6344661511213 - 29 = 6344661510701 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6344661511213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6344661511273) 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 as a sum of consecutive naturals, namely, 3172330755606 + 3172330755607.
It is an arithmetic number, because the mean of its divisors is an integer number (3172330755607).
Almost surely, 26344661511213 is an apocalyptic number.
It is an amenable number.
6344661511213 is a deficient number, since it is larger than the sum of its proper divisors (1).
6344661511213 is an equidigital number, since it uses as much as digits as its factorization.
6344661511213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 311040, while the sum is 43.
The spelling of 6344661511213 in words is "six trillion, three hundred forty-four billion, six hundred sixty-one million, five hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •