Base | Representation |
---|---|
bin | 110001110001101110010… |
… | …101010011001100110001 |
3 | 110010000021122010121010202 |
4 | 301301232111103030301 |
5 | 422020440112420131 |
6 | 11135231142404545 |
7 | 502063526100560 |
oct | 61615625231461 |
9 | 13100248117122 |
10 | 3420645045041 |
11 | 10a9761a51a74 |
12 | 472b3b130755 |
13 | 1ba747383713 |
14 | bb7bacd1bd7 |
15 | 5dea3822bcb |
hex | 31c6e553331 |
3420645045041 has 8 divisors (see below), whose sum is σ = 4115061708480. Its totient is φ = 2777666653008.
The previous prime is 3420645044941. The next prime is 3420645045091. The reversal of 3420645045041 is 1405405460243.
3420645045041 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 3420645045041 - 226 = 3420577936177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3420645044986 and 3420645045004.
It is not an unprimeable number, because it can be changed into a prime (3420645045091) 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, 12859567706 + ... + 12859567971.
It is an arithmetic number, because the mean of its divisors is an integer number (514382713560).
Almost surely, 23420645045041 is an apocalyptic number.
It is an amenable number.
3420645045041 is a deficient number, since it is larger than the sum of its proper divisors (694416663439).
3420645045041 is a wasteful number, since it uses less digits than its factorization.
3420645045041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25719135703.
The product of its (nonzero) digits is 230400, while the sum is 38.
The spelling of 3420645045041 in words is "three trillion, four hundred twenty billion, six hundred forty-five million, forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •