Base | Representation |
---|---|
bin | 100111001110011… |
… | …1011000011001100 |
3 | 10101201200010111000 |
4 | 1032130323003030 |
5 | 10143422022443 |
6 | 334334500300 |
7 | 44421361425 |
oct | 11634730314 |
9 | 3351603430 |
10 | 1316204748 |
11 | 615a66121 |
12 | 308964690 |
13 | 17c8bcaa1 |
14 | c6b3c64c |
15 | 7a8418d3 |
hex | 4e73b0cc |
1316204748 has 36 divisors (see below), whose sum is σ = 3413360440. Its totient is φ = 438609240.
The previous prime is 1316204741. The next prime is 1316204767. The reversal of 1316204748 is 8474026131.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (1316204741) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 375283 + ... + 378773.
Almost surely, 21316204748 is an apocalyptic number.
1316204748 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1316204748 is an abundant number, since it is smaller than the sum of its proper divisors (2097155692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1316204748 is an frugal number, since it uses more digits than its factorization.
1316204748 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6995 (or 3496 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 1316204748 is about 36279.5362153377. The cubic root of 1316204748 is about 1095.9089768920.
The spelling of 1316204748 in words is "one billion, three hundred sixteen million, two hundred four thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •