Base | Representation |
---|---|
bin | 1100000110110111110111… |
… | …0010011001100101111011 |
3 | 1202010122011002020202211202 |
4 | 3001231331302121211323 |
5 | 3221101403241424311 |
6 | 44151314030244415 |
7 | 2542530034054211 |
oct | 301557562314573 |
9 | 52118132222752 |
10 | 13312214014331 |
11 | 4272750842811 |
12 | 15abbb565670b |
13 | 75744b0a192b |
14 | 340459374cb1 |
15 | 18143428ce3b |
hex | c1b7dc9997b |
13312214014331 has 32 divisors (see below), whose sum is σ = 13954494951936. Its totient is φ = 12687274080000.
The previous prime is 13312214014301. The next prime is 13312214014339. The reversal of 13312214014331 is 13341041221331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13312214014331 is a prime.
It is a super-2 number, since 2×133122140143312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13312214014294 and 13312214014303.
It is not an unprimeable number, because it can be changed into a prime (13312214014339) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 647754506 + ... + 647775056.
It is an arithmetic number, because the mean of its divisors is an integer number (436077967248).
Almost surely, 213312214014331 is an apocalyptic number.
13312214014331 is a deficient number, since it is larger than the sum of its proper divisors (642280937605).
13312214014331 is a wasteful number, since it uses less digits than its factorization.
13312214014331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21923.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 13312214014331 its reverse (13341041221331), we get a palindrome (26653255235662).
The spelling of 13312214014331 in words is "thirteen trillion, three hundred twelve billion, two hundred fourteen million, fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •