Base | Representation |
---|---|
bin | 110000111110011… |
… | …1000100000011000 |
3 | 11020112020211110022 |
4 | 1201330320200120 |
5 | 11331144200130 |
6 | 431022410012 |
7 | 55503146663 |
oct | 14174704030 |
9 | 4215224408 |
10 | 1643350040 |
11 | 7736a0232 |
12 | 39a430908 |
13 | 202603397 |
14 | 11837a6da |
15 | 994137e5 |
hex | 61f38818 |
1643350040 has 16 divisors (see below), whose sum is σ = 3697537680. Its totient is φ = 657340000.
The previous prime is 1643350039. The next prime is 1643350043. The reversal of 1643350040 is 400533461.
It is a junction number, because it is equal to n+sod(n) for n = 1643349991 and 1643350009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1643350043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20541836 + ... + 20541915.
It is an arithmetic number, because the mean of its divisors is an integer number (231096105).
Almost surely, 21643350040 is an apocalyptic number.
1643350040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1643350040 is an abundant number, since it is smaller than the sum of its proper divisors (2054187640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1643350040 is a wasteful number, since it uses less digits than its factorization.
1643350040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41083762 (or 41083758 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 1643350040 is about 40538.2540324568. The cubic root of 1643350040 is about 1180.0761322133.
The spelling of 1643350040 in words is "one billion, six hundred forty-three million, three hundred fifty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •