Base | Representation |
---|---|
bin | 111101100011100… |
… | …1000100011111010 |
3 | 12022221112121221120 |
4 | 1323013020203322 |
5 | 13212224431032 |
6 | 540542050110 |
7 | 102120120360 |
oct | 17307104372 |
9 | 5287477846 |
10 | 2065467642 |
11 | 96a9a2457 |
12 | 497879936 |
13 | 26bbb9c04 |
14 | 15845b630 |
15 | c14e562c |
hex | 7b1c88fa |
2065467642 has 16 divisors (see below), whose sum is σ = 4721068992. Its totient is φ = 590133600.
The previous prime is 2065467641. The next prime is 2065467673. The reversal of 2065467642 is 2467645602.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 49177801 = 2065467642 / (2 + 0 + 6 + 5 + 4 + 6 + 7 + 6 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2065467594 and 2065467603.
It is not an unprimeable number, because it can be changed into a prime (2065467641) 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 7 ways as a sum of consecutive naturals, for example, 24588859 + ... + 24588942.
It is an arithmetic number, because the mean of its divisors is an integer number (295066812).
Almost surely, 22065467642 is an apocalyptic number.
2065467642 is an abundant number, since it is smaller than the sum of its proper divisors (2655601350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2065467642 is a wasteful number, since it uses less digits than its factorization.
2065467642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49177813.
The product of its (nonzero) digits is 483840, while the sum is 42.
The square root of 2065467642 is about 45447.4162301885. The cubic root of 2065467642 is about 1273.5210619452.
The spelling of 2065467642 in words is "two billion, sixty-five million, four hundred sixty-seven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •