Base | Representation |
---|---|
bin | 1100000000011010110011… |
… | …0100110101100000100101 |
3 | 1201202000221200000002020002 |
4 | 3000012230310311200211 |
5 | 3212242313003014141 |
6 | 44024335323351045 |
7 | 2531523235550633 |
oct | 300065464654045 |
9 | 51660850002202 |
10 | 13201334032421 |
11 | 422a7219a3227 |
12 | 1592610082485 |
13 | 749b5a499a92 |
14 | 338d3b366353 |
15 | 17d5e4cbee9b |
hex | c01acd35825 |
13201334032421 has 4 divisors (see below), whose sum is σ = 13223372988000. Its totient is φ = 13179295076844.
The previous prime is 13201334032379. The next prime is 13201334032429. The reversal of 13201334032421 is 12423043310231.
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 a cyclic number.
It is not a de Polignac number, because 13201334032421 - 210 = 13201334031397 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 (13201334032429) 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, 11019476891 + ... + 11019478088.
It is an arithmetic number, because the mean of its divisors is an integer number (3305843247000).
Almost surely, 213201334032421 is an apocalyptic number.
It is an amenable number.
13201334032421 is a deficient number, since it is larger than the sum of its proper divisors (22038955579).
13201334032421 is an equidigital number, since it uses as much as digits as its factorization.
13201334032421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22038955578.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 13201334032421 its reverse (12423043310231), we get a palindrome (25624377342652).
The spelling of 13201334032421 in words is "thirteen trillion, two hundred one billion, three hundred thirty-four million, thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •