Base | Representation |
---|---|
bin | 1100100111010011110010… |
… | …0111110110011010000101 |
3 | 1211002220111222001222211112 |
4 | 3021310330213312122011 |
5 | 3304214131404300323 |
6 | 45255313412414405 |
7 | 2631015210622103 |
oct | 311647447663205 |
9 | 54086458058745 |
10 | 13869466478213 |
11 | 446800a283765 |
12 | 167bbb4317405 |
13 | 797b6768b368 |
14 | 35d4001a2c73 |
15 | 190b9b2ee178 |
hex | c9d3c9f6685 |
13869466478213 has 4 divisors (see below), whose sum is σ = 13869749525580. Its totient is φ = 13869183430848.
The previous prime is 13869466478201. The next prime is 13869466478221. The reversal of 13869466478213 is 31287466496831.
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 1698452743009 + 12171013735204 = 1303247^2 + 3488698^2 .
It is a cyclic number.
It is not a de Polignac number, because 13869466478213 - 210 = 13869466477189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13869466438213) 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, 141450170 + ... + 141548187.
It is an arithmetic number, because the mean of its divisors is an integer number (3467437381395).
Almost surely, 213869466478213 is an apocalyptic number.
It is an amenable number.
13869466478213 is a deficient number, since it is larger than the sum of its proper divisors (283047367).
13869466478213 is an equidigital number, since it uses as much as digits as its factorization.
13869466478213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283047366.
The product of its digits is 250822656, while the sum is 68.
The spelling of 13869466478213 in words is "thirteen trillion, eight hundred sixty-nine billion, four hundred sixty-six million, four hundred seventy-eight thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •