Base | Representation |
---|---|
bin | 1011110110100101001101… |
… | …1010110110010100001101 |
3 | 1201010212201111201010010202 |
4 | 2331221103122312110031 |
5 | 3202010203030320323 |
6 | 43414545255343245 |
7 | 2513361202664435 |
oct | 275512332662415 |
9 | 51125644633122 |
10 | 13032330323213 |
11 | 4174a86796083 |
12 | 1565905081b25 |
13 | 736c35a81796 |
14 | 330aa7b532c5 |
15 | 179002b71d28 |
hex | bda536b650d |
13032330323213 has 4 divisors (see below), whose sum is σ = 13598953380768. Its totient is φ = 12465707265660.
The previous prime is 13032330323147. The next prime is 13032330323219. The reversal of 13032330323213 is 31232303323031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 13032330323213 - 210 = 13032330322189 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 (13032330323219) 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, 283311528743 + ... + 283311528788.
It is an arithmetic number, because the mean of its divisors is an integer number (3399738345192).
Almost surely, 213032330323213 is an apocalyptic number.
It is an amenable number.
13032330323213 is a deficient number, since it is larger than the sum of its proper divisors (566623057555).
13032330323213 is an equidigital number, since it uses as much as digits as its factorization.
13032330323213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 566623057554.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 13032330323213 its reverse (31232303323031), we get a palindrome (44264633646244).
The spelling of 13032330323213 in words is "thirteen trillion, thirty-two billion, three hundred thirty million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •