Base | Representation |
---|---|
bin | 101001000010010… |
… | …0110101100000000 |
3 | 10112221221201212120 |
4 | 1102010212230000 |
5 | 10304444020002 |
6 | 344344324240 |
7 | 46056533460 |
oct | 12204465400 |
9 | 3487851776 |
10 | 1376938752 |
11 | 647278512 |
12 | 325173680 |
13 | 18c365b77 |
14 | d0c2bba0 |
15 | 80d3bcbc |
hex | 52126b00 |
1376938752 has 144 divisors (see below), whose sum is σ = 4291026432. Its totient is φ = 383754240.
The previous prime is 1376938741. The next prime is 1376938753. The reversal of 1376938752 is 2578396731.
It is a junction number, because it is equal to n+sod(n) for n = 1376938695 and 1376938704.
It is not an unprimeable number, because it can be changed into a prime (1376938753) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217293 + ... + 223539.
Almost surely, 21376938752 is an apocalyptic number.
1376938752 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 1376938752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2145513216).
1376938752 is an abundant number, since it is smaller than the sum of its proper divisors (2914087680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1376938752 is an equidigital number, since it uses as much as digits as its factorization.
1376938752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6314 (or 6300 counting only the distinct ones).
The product of its digits is 1905120, while the sum is 51.
The square root of 1376938752 is about 37107.1253534951. The cubic root of 1376938752 is about 1112.5124356982.
The spelling of 1376938752 in words is "one billion, three hundred seventy-six million, nine hundred thirty-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •