Base | Representation |
---|---|
bin | 1100000000011001100011… |
… | …1010101001110011010011 |
3 | 1201202000002101111010201211 |
4 | 3000012120322221303103 |
5 | 3212241122000404021 |
6 | 44024242232240551 |
7 | 2531512041462256 |
oct | 300063072516323 |
9 | 51660071433654 |
10 | 13201000013011 |
11 | 422a5703a3528 |
12 | 1592538240157 |
13 | 749b0621a665 |
14 | 338d08c5909d |
15 | 17d5c57e13e1 |
hex | c0198ea9cd3 |
13201000013011 has 4 divisors (see below), whose sum is σ = 13895789487400. Its totient is φ = 12506210538624.
The previous prime is 13201000013009. The next prime is 13201000013017. The reversal of 13201000013011 is 11031000010231.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13201000013011 - 21 = 13201000013009 is a prime.
It is a super-2 number, since 2×132010000130112 (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 = 13201000012982 and 13201000013000.
It is not an unprimeable number, because it can be changed into a prime (13201000013017) 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, 347394737166 + ... + 347394737203.
It is an arithmetic number, because the mean of its divisors is an integer number (3473947371850).
Almost surely, 213201000013011 is an apocalyptic number.
13201000013011 is a deficient number, since it is larger than the sum of its proper divisors (694789474389).
13201000013011 is an equidigital number, since it uses as much as digits as its factorization.
13201000013011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 694789474388.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13201000013011 its reverse (11031000010231), we get a palindrome (24232000023242).
The spelling of 13201000013011 in words is "thirteen trillion, two hundred one billion, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •