Base | Representation |
---|---|
bin | 100111001111010… |
… | …1100001010011110 |
3 | 10101202112200000210 |
4 | 1032132230022132 |
5 | 10144031334222 |
6 | 334352433250 |
7 | 44425331253 |
oct | 11636541236 |
9 | 3352480023 |
10 | 1316668062 |
11 | 616252226 |
12 | 308b48826 |
13 | 17ca22938 |
14 | c6c1d42a |
15 | 7a8d3d0c |
hex | 4e7ac29e |
1316668062 has 8 divisors (see below), whose sum is σ = 2633336136. Its totient is φ = 438889352.
The previous prime is 1316668057. The next prime is 1316668081. The reversal of 1316668062 is 2608666131.
It is a sphenic number, since it is the product of 3 distinct primes.
1316668062 is an admirable number.
It is a super-2 number, since 2×13166680622 = 3467229570981671688, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1316668062.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 109722333 + ... + 109722344.
It is an arithmetic number, because the mean of its divisors is an integer number (329167017).
Almost surely, 21316668062 is an apocalyptic number.
1316668062 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1316668062 is a wasteful number, since it uses less digits than its factorization.
1316668062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219444682.
The product of its (nonzero) digits is 62208, while the sum is 39.
The square root of 1316668062 is about 36285.9209887251. The cubic root of 1316668062 is about 1096.0375512158.
The spelling of 1316668062 in words is "one billion, three hundred sixteen million, six hundred sixty-eight thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •