Base | Representation |
---|---|
bin | 1101100110010101… |
… | …0001011010101101 |
3 | 100102101220212211000 |
4 | 3121211101122231 |
5 | 24434002122131 |
6 | 1402121150513 |
7 | 156314053656 |
oct | 33145213255 |
9 | 10371825730 |
10 | 3650426541 |
11 | 1603630543 |
12 | 85a62b439 |
13 | 462387708 |
14 | 268b5852d |
15 | 165722ce6 |
hex | d99516ad |
3650426541 has 16 divisors (see below), whose sum is σ = 5726160000. Its totient is φ = 2290463424.
The previous prime is 3650426519. The next prime is 3650426557. The reversal of 3650426541 is 1456240563.
It is not a de Polignac number, because 3650426541 - 211 = 3650424493 is a prime.
It is a super-2 number, since 2×36504265412 = 26651227862474449362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3650426496 and 3650426505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3650426501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3976041 + ... + 3976958.
It is an arithmetic number, because the mean of its divisors is an integer number (357885000).
Almost surely, 23650426541 is an apocalyptic number.
It is an amenable number.
3650426541 is a deficient number, since it is larger than the sum of its proper divisors (2075733459).
3650426541 is a wasteful number, since it uses less digits than its factorization.
3650426541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7953025 (or 7953019 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 3650426541 is about 60418.7598432805. The cubic root of 3650426541 is about 1539.7416979776.
The spelling of 3650426541 in words is "three billion, six hundred fifty million, four hundred twenty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •