Base | Representation |
---|---|
bin | 10111110111101101110… |
… | …100000010011110011000 |
3 | 12210211002101000221222120 |
4 | 113313231310002132120 |
5 | 203333440312202332 |
6 | 3253324321021240 |
7 | 226340646120330 |
oct | 27675564023630 |
9 | 5724071027876 |
10 | 1640372381592 |
11 | 58275049930a |
12 | 225ab9484820 |
13 | bb8c0199c29 |
14 | 595745100c0 |
15 | 2ca0ab2632c |
hex | 17dedd02798 |
1640372381592 has 32 divisors (see below), whose sum is σ = 4686778233600. Its totient is φ = 468677823264.
The previous prime is 1640372381579. The next prime is 1640372381611. The reversal of 1640372381592 is 2951832730461.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4882060492 + ... + 4882060827.
It is an arithmetic number, because the mean of its divisors is an integer number (146461819800).
It is a 1-persistent number, because it is pandigital, but 2⋅1640372381592 = 3280744763184 is not.
Almost surely, 21640372381592 is an apocalyptic number.
1640372381592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1640372381592 is an abundant number, since it is smaller than the sum of its proper divisors (3046405852008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1640372381592 is a wasteful number, since it uses less digits than its factorization.
1640372381592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9764121335 (or 9764121331 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 1640372381592 in words is "one trillion, six hundred forty billion, three hundred seventy-two million, three hundred eighty-one thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •