Base | Representation |
---|---|
bin | 100111001110000… |
… | …1010001011000111 |
3 | 10101201021221212022 |
4 | 1032130022023013 |
5 | 10143344121201 |
6 | 334330313355 |
7 | 44416565651 |
oct | 11634121307 |
9 | 3351257768 |
10 | 1316004551 |
11 | 615939774 |
12 | 30888885b |
13 | 17c84c924 |
14 | c6ac96d1 |
15 | 7a80241b |
hex | 4e70a2c7 |
1316004551 has 8 divisors (see below), whose sum is σ = 1347688320. Its totient is φ = 1284369912.
The previous prime is 1316004541. The next prime is 1316004577. The reversal of 1316004551 is 1554006131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1316004551 is a prime.
It is a super-3 number, since 3×13160045513 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1316004551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1316004541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45116 + ... + 68318.
It is an arithmetic number, because the mean of its divisors is an integer number (168461040).
Almost surely, 21316004551 is an apocalyptic number.
1316004551 is a deficient number, since it is larger than the sum of its proper divisors (31683769).
1316004551 is a wasteful number, since it uses less digits than its factorization.
1316004551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24565.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 1316004551 is about 36276.7770205679. Note that the first 3 decimals coincide. The cubic root of 1316004551 is about 1095.8534108629.
The spelling of 1316004551 in words is "one billion, three hundred sixteen million, four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •