Base | Representation |
---|---|
bin | 100011111111111011101101… |
… | …0101100101111110000110101 |
3 | 1112112011110100012202210121102 |
4 | 1013333313122230233300311 |
5 | 313000443433030420121 |
6 | 3041243021332055445 |
7 | 123461134325365361 |
oct | 10777673254576065 |
9 | 1475143305683542 |
10 | 316650133060661 |
11 | 91992627073a24 |
12 | 2b620b00a64585 |
13 | 1078bc96a37c5a |
14 | 5829d3bc842a1 |
15 | 2691be398290b |
hex | 11ffddab2fc35 |
316650133060661 has 4 divisors (see below), whose sum is σ = 335276611476012. Its totient is φ = 298023654645312.
The previous prime is 316650133060609. The next prime is 316650133060769. The reversal of 316650133060661 is 166060331056613.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 169256717416900 + 147393415643761 = 13009870^2 + 12140569^2 .
It is a cyclic number.
It is not a de Polignac number, because 316650133060661 - 214 = 316650133044277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316650133060361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9313239207650 + ... + 9313239207683.
It is an arithmetic number, because the mean of its divisors is an integer number (83819152869003).
Almost surely, 2316650133060661 is an apocalyptic number.
It is an amenable number.
316650133060661 is a deficient number, since it is larger than the sum of its proper divisors (18626478415351).
316650133060661 is a wasteful number, since it uses less digits than its factorization.
316650133060661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18626478415350.
The product of its (nonzero) digits is 1049760, while the sum is 47.
The spelling of 316650133060661 in words is "three hundred sixteen trillion, six hundred fifty billion, one hundred thirty-three million, sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •