Base | Representation |
---|---|
bin | 1100000010000101100110… |
… | …1101110001100011001111 |
3 | 1201211202221202102212021021 |
4 | 3000201121231301203033 |
5 | 3213230022114141333 |
6 | 44045440302015011 |
7 | 2533556562201532 |
oct | 300413155614317 |
9 | 51752852385237 |
10 | 13230004443343 |
11 | 42408a466a306 |
12 | 1598091877467 |
13 | 74c779266c7c |
14 | 33a49ad8aa19 |
15 | 17e221d1182d |
hex | c0859b718cf |
13230004443343 has 4 divisors (see below), whose sum is σ = 13358451088528. Its totient is φ = 13101557798160.
The previous prime is 13230004443239. The next prime is 13230004443371. The reversal of 13230004443343 is 34334440003231.
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 13230004443343 - 217 = 13230004312271 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13230004443299 and 13230004443308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13230004441343) 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, 64223322438 + ... + 64223322643.
It is an arithmetic number, because the mean of its divisors is an integer number (3339612772132).
Almost surely, 213230004443343 is an apocalyptic number.
13230004443343 is a deficient number, since it is larger than the sum of its proper divisors (128446645185).
13230004443343 is a wasteful number, since it uses less digits than its factorization.
13230004443343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128446645184.
The product of its (nonzero) digits is 124416, while the sum is 34.
Adding to 13230004443343 its reverse (34334440003231), we get a palindrome (47564444446574).
The spelling of 13230004443343 in words is "thirteen trillion, two hundred thirty billion, four million, four hundred forty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •