Base | Representation |
---|---|
bin | 110101000001000111011… |
… | …101001101011010000010 |
3 | 110220022002000020121102012 |
4 | 311001013131031122002 |
5 | 434143020230401214 |
6 | 11425420113452522 |
7 | 524136066302345 |
oct | 65010735153202 |
9 | 13808060217365 |
10 | 3643331106434 |
11 | 1185145478938 |
12 | 4aa128271142 |
13 | 2057456c3756 |
14 | c84a3d0045c |
15 | 64b8874303e |
hex | 3504774d682 |
3643331106434 has 8 divisors (see below), whose sum is σ = 5612699272188. Its totient is φ = 1772431349040.
The previous prime is 3643331106413. The next prime is 3643331106479. The reversal of 3643331106434 is 4346011333463.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 3495602340409 + 147728766025 = 1869653^2 + 384355^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×36433311064342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3643331106391 and 3643331106400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24617101997 + ... + 24617102144.
Almost surely, 23643331106434 is an apocalyptic number.
3643331106434 is a deficient number, since it is larger than the sum of its proper divisors (1969368165754).
3643331106434 is a wasteful number, since it uses less digits than its factorization.
3643331106434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49234204180.
The product of its (nonzero) digits is 559872, while the sum is 41.
Adding to 3643331106434 its reverse (4346011333463), we get a palindrome (7989342439897).
The spelling of 3643331106434 in words is "three trillion, six hundred forty-three billion, three hundred thirty-one million, one hundred six thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •