Base | Representation |
---|---|
bin | 111011011000111… |
… | …0011000011001001 |
3 | 12010212201222112212 |
4 | 1312301303003021 |
5 | 13040122000031 |
6 | 525423514505 |
7 | 100245141236 |
oct | 16661630311 |
9 | 5125658485 |
10 | 1992765641 |
11 | 932956359 |
12 | 477458a35 |
13 | 259b13589 |
14 | 14c93478d |
15 | b9e3412b |
hex | 76c730c9 |
1992765641 has 8 divisors (see below), whose sum is σ = 2039737920. Its totient is φ = 1945822032.
The previous prime is 1992765637. The next prime is 1992765661. The reversal of 1992765641 is 1465672991.
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 1992765641 - 22 = 1992765637 is a prime.
It is a super-2 number, since 2×19927656412 = 7942229799900281762, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1992765641.
It is not an unprimeable number, because it can be changed into a prime (1992765611) 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, 209180 + ... + 218498.
It is an arithmetic number, because the mean of its divisors is an integer number (254967240).
Almost surely, 21992765641 is an apocalyptic number.
It is an amenable number.
1992765641 is a deficient number, since it is larger than the sum of its proper divisors (46972279).
1992765641 is an equidigital number, since it uses as much as digits as its factorization.
1992765641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14335.
The product of its digits is 816480, while the sum is 50.
The square root of 1992765641 is about 44640.4036832106. The cubic root of 1992765641 is about 1258.4000943640.
The spelling of 1992765641 in words is "one billion, nine hundred ninety-two million, seven hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •