Base | Representation |
---|---|
bin | 110010000111000001110… |
… | …011111001000110011101 |
3 | 110012012022212011112121110 |
4 | 302013001303321012131 |
5 | 422404312211110023 |
6 | 11153533105052233 |
7 | 503533434352665 |
oct | 62070163710635 |
9 | 13165285145543 |
10 | 3443520410013 |
11 | 1108430554282 |
12 | 477464027079 |
13 | 1bc951685038 |
14 | bc94b0191a5 |
15 | 5e891c13a93 |
hex | 321c1cf919d |
3443520410013 has 8 divisors (see below), whose sum is σ = 4646678143968. Its totient is φ = 2268021474704.
The previous prime is 3443520409981. The next prime is 3443520410017. The reversal of 3443520410013 is 3100140253443.
3443520410013 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 3443520410013 - 25 = 3443520409981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3443520410017) 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, 6914699370 + ... + 6914699867.
It is an arithmetic number, because the mean of its divisors is an integer number (580834767996).
Almost surely, 23443520410013 is an apocalyptic number.
It is an amenable number.
3443520410013 is a deficient number, since it is larger than the sum of its proper divisors (1203157733955).
3443520410013 is a wasteful number, since it uses less digits than its factorization.
3443520410013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13829399323.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 3443520410013 its reverse (3100140253443), we get a palindrome (6543660663456).
The spelling of 3443520410013 in words is "three trillion, four hundred forty-three billion, five hundred twenty million, four hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •