Base | Representation |
---|---|
bin | 100011111011001110000101… |
… | …1000110011111000011000101 |
3 | 1112102212112102221020201112102 |
4 | 1013312130023012133003011 |
5 | 312404340411143140423 |
6 | 3040025300101001445 |
7 | 123363264116225006 |
oct | 10766341306370305 |
9 | 1472775387221472 |
10 | 316002405052613 |
11 | 9176295a539584 |
12 | 2b5374720b3285 |
13 | 10742b8bc57786 |
14 | 5806852d2b1ad |
15 | 267ee3395cc28 |
hex | 11f670b19f0c5 |
316002405052613 has 4 divisors (see below), whose sum is σ = 316007019035820. Its totient is φ = 315997791069408.
The previous prime is 316002405052603. The next prime is 316002405052627. The reversal of 316002405052613 is 316250504200613.
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 222215130961924 + 93787274090689 = 14906882^2 + 9684383^2 .
It is a cyclic number.
It is not a de Polignac number, because 316002405052613 - 218 = 316002404790469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316002405052603) 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, 2306888870 + ... + 2307025847.
It is an arithmetic number, because the mean of its divisors is an integer number (79001754758955).
Almost surely, 2316002405052613 is an apocalyptic number.
It is an amenable number.
316002405052613 is a deficient number, since it is larger than the sum of its proper divisors (4613983207).
316002405052613 is an equidigital number, since it uses as much as digits as its factorization.
316002405052613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4613983206.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 316002405052613 in words is "three hundred sixteen trillion, two billion, four hundred five million, fifty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •