Base | Representation |
---|---|
bin | 110000101011011110001… |
… | …011100011000011111001 |
3 | 102211210120120210020122102 |
4 | 300223132023203003321 |
5 | 414301443301003213 |
6 | 11040434053233145 |
7 | 463453321623263 |
oct | 60533613430371 |
9 | 12753516706572 |
10 | 3345212125433 |
11 | 107a773042aa2 |
12 | 4603a89327b5 |
13 | 1b35b54b1049 |
14 | b7ca2924b33 |
15 | 5c03b293158 |
hex | 30ade2e30f9 |
3345212125433 has 8 divisors (see below), whose sum is σ = 3577058512200. Its totient is φ = 3117262316800.
The previous prime is 3345212125429. The next prime is 3345212125441.
3345212125433 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 2657578123264 + 687634002169 = 1630208^2 + 829237^2 .
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 3345212125433 - 22 = 3345212125429 is a prime.
It is a super-2 number, since 2×33452121254332 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3345212125403) 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, 974142758 + ... + 974146191.
It is an arithmetic number, because the mean of its divisors is an integer number (447132314025).
Almost surely, 23345212125433 is an apocalyptic number.
It is an amenable number.
3345212125433 is a deficient number, since it is larger than the sum of its proper divisors (231846386767).
3345212125433 is a wasteful number, since it uses less digits than its factorization.
3345212125433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1948289067.
The product of its digits is 259200, while the sum is 38.
The spelling of 3345212125433 in words is "three trillion, three hundred forty-five billion, two hundred twelve million, one hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •