Base | Representation |
---|---|
bin | 1011111010100110001110… |
… | …0101111001010011000001 |
3 | 1201101110210121002021211102 |
4 | 2332221203211321103001 |
5 | 3204123001202144301 |
6 | 43510355220024145 |
7 | 2521352644120352 |
oct | 276514345712301 |
9 | 51343717067742 |
10 | 13101321131201 |
11 | 41a126a256266 |
12 | 1577159b32055 |
13 | 7405ac0c10a4 |
14 | 334170707d29 |
15 | 17abde887b6b |
hex | bea639794c1 |
13101321131201 has 8 divisors (see below), whose sum is σ = 13218909652608. Its totient is φ = 12983998950000.
The previous prime is 13101321131159. The next prime is 13101321131209. The reversal of 13101321131201 is 10213112310131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13101321131201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13101321131209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66486230 + ... + 66682991.
It is an arithmetic number, because the mean of its divisors is an integer number (1652363706576).
Almost surely, 213101321131201 is an apocalyptic number.
It is an amenable number.
13101321131201 is a deficient number, since it is larger than the sum of its proper divisors (117588521407).
13101321131201 is a wasteful number, since it uses less digits than its factorization.
13101321131201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133170103.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13101321131201 its reverse (10213112310131), we get a palindrome (23314433441332).
The spelling of 13101321131201 in words is "thirteen trillion, one hundred one billion, three hundred twenty-one million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •