Base | Representation |
---|---|
bin | 11000100000001001000… |
… | …000111000100011110000 |
3 | 12221222010102010111110220 |
4 | 120200021000320203300 |
5 | 210041334233003030 |
6 | 3325303410453040 |
7 | 232435412211321 |
oct | 30401100704360 |
9 | 5858112114426 |
10 | 1683778406640 |
11 | 59a0a5018390 |
12 | 2323b1b94180 |
13 | c2a19aa4815 |
14 | 5b6d11b6448 |
15 | 2dbeb655a10 |
hex | 188090388f0 |
1683778406640 has 160 divisors (see below), whose sum is σ = 5694760083456. Its totient is φ = 408150881280.
The previous prime is 1683778406627. The next prime is 1683778406671. The reversal of 1683778406640 is 466048773861.
It is a happy number.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 37484034 + ... + 37528926.
Almost surely, 21683778406640 is an apocalyptic number.
1683778406640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1683778406640 is an abundant number, since it is smaller than the sum of its proper divisors (4010981676816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1683778406640 is a wasteful number, since it uses less digits than its factorization.
1683778406640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59127 (or 59121 counting only the distinct ones).
The product of its (nonzero) digits is 32514048, while the sum is 60.
The spelling of 1683778406640 in words is "one trillion, six hundred eighty-three billion, seven hundred seventy-eight million, four hundred six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •