Base | Representation |
---|---|
bin | 1100000000101100100011… |
… | …1101101000000110010011 |
3 | 1201202111020220000111010011 |
4 | 3000023020331220012103 |
5 | 3212332043333104011 |
6 | 44030444333415351 |
7 | 2532052331636251 |
oct | 300131075500623 |
9 | 51674226014104 |
10 | 13206101066131 |
11 | 4231748851206 |
12 | 159352063a557 |
13 | 74a439c9b19c |
14 | 3392705035d1 |
15 | 17d7c3559621 |
hex | c02c8f68193 |
13206101066131 has 4 divisors (see below), whose sum is σ = 13901159017000. Its totient is φ = 12511043115264.
The previous prime is 13206101066113. The next prime is 13206101066153. The reversal of 13206101066131 is 13166010160231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13206101066131 is a prime.
It is a super-2 number, since 2×132061010661312 (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 = 13206101066093 and 13206101066102.
It is not an unprimeable number, because it can be changed into a prime (13206101066111) 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, 347528975406 + ... + 347528975443.
It is an arithmetic number, because the mean of its divisors is an integer number (3475289754250).
Almost surely, 213206101066131 is an apocalyptic number.
13206101066131 is a deficient number, since it is larger than the sum of its proper divisors (695057950869).
13206101066131 is an equidigital number, since it uses as much as digits as its factorization.
13206101066131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 695057950868.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 13206101066131 in words is "thirteen trillion, two hundred six billion, one hundred one million, sixty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •