Base | Representation |
---|---|
bin | 111111111100001… |
… | …101100011100000 |
3 | 2202202120021122212 |
4 | 333330031203200 |
5 | 4144110430033 |
6 | 254240421252 |
7 | 35404133300 |
oct | 7774154340 |
9 | 2682507585 |
10 | 1072748768 |
11 | 5005a2033 |
12 | 25b317828 |
13 | 14132bbb0 |
14 | a2687600 |
15 | 642a1748 |
hex | 3ff0d8e0 |
1072748768 has 72 divisors (see below), whose sum is σ = 2645820072. Its totient is φ = 424376064.
The previous prime is 1072748767. The next prime is 1072748777. The reversal of 1072748768 is 8678472701.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1072748767) 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, 5930 + ... + 46697.
It is an arithmetic number, because the mean of its divisors is an integer number (36747501).
Almost surely, 21072748768 is an apocalyptic number.
It is an amenable number.
1072748768 is an abundant number, since it is smaller than the sum of its proper divisors (1573071304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1072748768 is a wasteful number, since it uses less digits than its factorization.
1072748768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52664 (or 52649 counting only the distinct ones).
The product of its (nonzero) digits is 1053696, while the sum is 50.
The square root of 1072748768 is about 32752.8436628028. The cubic root of 1072748768 is about 1023.6842186286.
It can be divided in two parts, 10727 and 48768, that added together give a palindrome (59495).
The spelling of 1072748768 in words is "one billion, seventy-two million, seven hundred forty-eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •