Base | Representation |
---|---|
bin | 1100000110011010011111… |
… | …1111101111101001110011 |
3 | 1202002212210210021012001211 |
4 | 3001212213333233221303 |
5 | 3220434233022033133 |
6 | 44143531552140551 |
7 | 2542130516656063 |
oct | 301464777575163 |
9 | 52085723235054 |
10 | 13304332221043 |
11 | 426a376771866 |
12 | 15aa575b37757 |
13 | 7567931a8416 |
14 | 33dd0c67b3a3 |
15 | 181122341bcd |
hex | c19a7fefa73 |
13304332221043 has 4 divisors (see below), whose sum is σ = 13304965269240. Its totient is φ = 13303699172848.
The previous prime is 13304332221041. The next prime is 13304332221097. The reversal of 13304332221043 is 34012223340331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13304332221043 - 21 = 13304332221041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13304332220996 and 13304332221014.
It is not an unprimeable number, because it can be changed into a prime (13304332221041) 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, 316492573 + ... + 316534606.
It is an arithmetic number, because the mean of its divisors is an integer number (3326241317310).
Almost surely, 213304332221043 is an apocalyptic number.
13304332221043 is a deficient number, since it is larger than the sum of its proper divisors (633048197).
13304332221043 is an equidigital number, since it uses as much as digits as its factorization.
13304332221043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633048196.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 13304332221043 its reverse (34012223340331), we get a palindrome (47316555561374).
The spelling of 13304332221043 in words is "thirteen trillion, three hundred four billion, three hundred thirty-two million, two hundred twenty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •