Base | Representation |
---|---|
bin | 101000111110110… |
… | …1110111100100000 |
3 | 10112211120020010001 |
4 | 1101331232330200 |
5 | 10304013400233 |
6 | 344241545344 |
7 | 46035322300 |
oct | 12175567440 |
9 | 3484506101 |
10 | 1375137568 |
11 | 646258232 |
12 | 324645254 |
13 | 18bb8508c |
14 | d08bd600 |
15 | 80ad327d |
hex | 51f6ef20 |
1375137568 has 72 divisors (see below), whose sum is σ = 3161530764. Its totient is φ = 587059200.
The previous prime is 1375137563. The next prime is 1375137611. The reversal of 1375137568 is 8657315731.
It can be written as a sum of positive squares in 2 ways, for example, as 1262523024 + 112614544 = 35532^2 + 10612^2 .
It is not an unprimeable number, because it can be changed into a prime (1375137563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 439048 + ... + 442168.
Almost surely, 21375137568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1375137568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1580765382).
1375137568 is an abundant number, since it is smaller than the sum of its proper divisors (1786393196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1375137568 is a wasteful number, since it uses less digits than its factorization.
1375137568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3426 (or 3411 counting only the distinct ones).
The product of its digits is 529200, while the sum is 46.
The square root of 1375137568 is about 37082.8473556171. The cubic root of 1375137568 is about 1112.0271287138.
The spelling of 1375137568 in words is "one billion, three hundred seventy-five million, one hundred thirty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •