Base | Representation |
---|---|
bin | 101000111101111… |
… | …0101100110000000 |
3 | 10112210121222021120 |
4 | 1101323311212000 |
5 | 10303401444022 |
6 | 344223152240 |
7 | 46031152200 |
oct | 12173654600 |
9 | 3483558246 |
10 | 1374640512 |
11 | 645a48843 |
12 | 324445680 |
13 | 18ba3ca6b |
14 | d07d0400 |
15 | 80a35d5c |
hex | 51ef5980 |
1374640512 has 192 divisors, whose sum is σ = 4348872000. Its totient is φ = 383394816.
The previous prime is 1374640499. The next prime is 1374640543. The reversal of 1374640512 is 2150464731.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 808239 + ... + 809937.
It is an arithmetic number, because the mean of its divisors is an integer number (22650375).
Almost surely, 21374640512 is an apocalyptic number.
1374640512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1374640512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2174436000).
1374640512 is an abundant number, since it is smaller than the sum of its proper divisors (2974231488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1374640512 is a wasteful number, since it uses less digits than its factorization.
1374640512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773 (or 1754 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 1374640512 is about 37076.1447834049. The cubic root of 1374640512 is about 1111.8931284556.
The spelling of 1374640512 in words is "one billion, three hundred seventy-four million, six hundred forty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •