Base | Representation |
---|---|
bin | 110001110110110001010… |
… | …001001010011000110101 |
3 | 110010112021012222021200111 |
4 | 301312301101022120311 |
5 | 422113034112014031 |
6 | 11141524524143021 |
7 | 502345015004134 |
oct | 61666121123065 |
9 | 13115235867614 |
10 | 3426063001141 |
11 | 1100a92279640 |
12 | 473bb1697a71 |
13 | 1bb0cb99c8c1 |
14 | bbb726ad91b |
15 | 5e1be2d81b1 |
hex | 31db144a635 |
3426063001141 has 8 divisors (see below), whose sum is σ = 3752413807968. Its totient is φ = 3102193950000.
The previous prime is 3426063001111. The next prime is 3426063001187. The reversal of 3426063001141 is 1411003606243.
It is a happy number.
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 3426063001141 - 219 = 3426062476853 is a prime.
It is a super-3 number, since 3×34260630011413 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3426063001111) 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, 620436030 + ... + 620441551.
It is an arithmetic number, because the mean of its divisors is an integer number (469051725996).
Almost surely, 23426063001141 is an apocalyptic number.
It is an amenable number.
3426063001141 is a deficient number, since it is larger than the sum of its proper divisors (326350806827).
3426063001141 is a wasteful number, since it uses less digits than its factorization.
3426063001141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1240877843.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 3426063001141 its reverse (1411003606243), we get a palindrome (4837066607384).
The spelling of 3426063001141 in words is "three trillion, four hundred twenty-six billion, sixty-three million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •