Base | Representation |
---|---|
bin | 1001001101111100010… |
… | …01010010110100001101 |
3 | 1010021111221200020000121 |
4 | 10212332021102310031 |
5 | 20142122004020023 |
6 | 401300031024541 |
7 | 31611453462160 |
oct | 4467611226415 |
9 | 1107457606017 |
10 | 316722720013 |
11 | 11235979a367 |
12 | 5147196b151 |
13 | 23b3654a6cb |
14 | 11488083ad7 |
15 | 838a863d5d |
hex | 49be252d0d |
316722720013 has 4 divisors (see below), whose sum is σ = 361968822880. Its totient is φ = 271476617148.
The previous prime is 316722720001. The next prime is 316722720023. The reversal of 316722720013 is 310027227613.
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 316722720013 - 29 = 316722719501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316722720023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22623051423 + ... + 22623051436.
It is an arithmetic number, because the mean of its divisors is an integer number (90492205720).
Almost surely, 2316722720013 is an apocalyptic number.
It is an amenable number.
316722720013 is a deficient number, since it is larger than the sum of its proper divisors (45246102867).
316722720013 is an equidigital number, since it uses as much as digits as its factorization.
316722720013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45246102866.
The product of its (nonzero) digits is 21168, while the sum is 34.
Adding to 316722720013 its reverse (310027227613), we get a palindrome (626749947626).
The spelling of 316722720013 in words is "three hundred sixteen billion, seven hundred twenty-two million, seven hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •