Base | Representation |
---|---|
bin | 110010000110111100000… |
… | …101000010111011110011 |
3 | 110012012002011012202212122 |
4 | 302012330011002323303 |
5 | 422404113101242233 |
6 | 11153515351544455 |
7 | 503531156064662 |
oct | 62067405027363 |
9 | 13165064182778 |
10 | 3443424243443 |
11 | 1108391240978 |
12 | 47743798b12b |
13 | 1bc937784342 |
14 | bc93c344dd9 |
15 | 5e888569d98 |
hex | 321bc142ef3 |
3443424243443 has 8 divisors (see below), whose sum is σ = 3602519912448. Its totient is φ = 3285110372104.
The previous prime is 3443424243439. The next prime is 3443424243487.
3443424243443 is nontrivially palindromic in base 10.
3443424243443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3443424243443 - 22 = 3443424243439 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3443424243394 and 3443424243403.
It is not an unprimeable number, because it can be changed into a prime (3443424242443) 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, 195440405 + ... + 195458022.
It is an arithmetic number, because the mean of its divisors is an integer number (450314989056).
Almost surely, 23443424243443 is an apocalyptic number.
3443424243443 is a deficient number, since it is larger than the sum of its proper divisors (159095669005).
3443424243443 is a wasteful number, since it uses less digits than its factorization.
3443424243443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390898833.
The product of its digits is 5308416, while the sum is 44.
The spelling of 3443424243443 in words is "three trillion, four hundred forty-three billion, four hundred twenty-four million, two hundred forty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •