Base | Representation |
---|---|
bin | 1011111010101101001110… |
… | …0101010010111100110001 |
3 | 1201101122122112112211220102 |
4 | 2332223103211102330301 |
5 | 3204140323201203241 |
6 | 43511305455122145 |
7 | 2521450340332133 |
oct | 276532345227461 |
9 | 51348575484812 |
10 | 13103200022321 |
11 | 41a20438a3a42 |
12 | 15775a3213355 |
13 | 74081b443896 |
14 | 3342ac079053 |
15 | 17ac9e7c639b |
hex | bead3952f31 |
13103200022321 has 8 divisors (see below), whose sum is σ = 13272815851680. Its totient is φ = 12933863858592.
The previous prime is 13103200022293. The next prime is 13103200022333. The reversal of 13103200022321 is 12322000230131.
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-13103200022321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13103200022293 and 13103200022302.
It is not an unprimeable number, because it can be changed into a prime (13103200021321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69822095 + ... + 70009508.
It is an arithmetic number, because the mean of its divisors is an integer number (1659101981460).
Almost surely, 213103200022321 is an apocalyptic number.
It is an amenable number.
13103200022321 is a deficient number, since it is larger than the sum of its proper divisors (169615829359).
13103200022321 is a wasteful number, since it uses less digits than its factorization.
13103200022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139832815.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13103200022321 its reverse (12322000230131), we get a palindrome (25425200252452).
The spelling of 13103200022321 in words is "thirteen trillion, one hundred three billion, two hundred million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •