Base | Representation |
---|---|
bin | 100011111011100010001011… |
… | …0110011010111011011111101 |
3 | 1112110000122210212000222202122 |
4 | 1013313010112303113123331 |
5 | 312411042242031242003 |
6 | 3040101153301132325 |
7 | 123366352244120306 |
oct | 10767042663273375 |
9 | 1473018725028678 |
10 | 316045551040253 |
11 | 9177a1902a9701 |
12 | 2b5438b36ba0a5 |
13 | 10746c76a17088 |
14 | 58089872637ad |
15 | 268110b724238 |
hex | 11f7116cd76fd |
316045551040253 has 4 divisors (see below), whose sum is σ = 317162319772128. Its totient is φ = 314928782308380.
The previous prime is 316045551040201. The next prime is 316045551040259. The reversal of 316045551040253 is 352040155540613.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 316045551040253 - 212 = 316045551036157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316045551040259) 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, 558384365513 + ... + 558384366078.
It is an arithmetic number, because the mean of its divisors is an integer number (79290579943032).
Almost surely, 2316045551040253 is an apocalyptic number.
It is an amenable number.
316045551040253 is a deficient number, since it is larger than the sum of its proper divisors (1116768731875).
316045551040253 is a wasteful number, since it uses less digits than its factorization.
316045551040253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1116768731874.
The product of its (nonzero) digits is 1080000, while the sum is 44.
The spelling of 316045551040253 in words is "three hundred sixteen trillion, forty-five billion, five hundred fifty-one million, forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •