Base | Representation |
---|---|
bin | 100100000000100010110110… |
… | …1101011110000101010000001 |
3 | 1112112110111100020000010202212 |
4 | 1020001011231223300222001 |
5 | 313003333122034302203 |
6 | 3041345403451551505 |
7 | 123500201553633455 |
oct | 11001055553605201 |
9 | 1475414306003685 |
10 | 316734203431553 |
11 | 91a15248658996 |
12 | 2b635263a5b595 |
13 | 10796ba422ca4b |
14 | 5830035450665 |
15 | 2693eb44771d8 |
hex | 120116daf0a81 |
316734203431553 has 8 divisors (see below), whose sum is σ = 330819723197376. Its totient is φ = 302674889286000.
The previous prime is 316734203431523. The next prime is 316734203431567. The reversal of 316734203431553 is 355134302437613.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 316734203431553 - 212 = 316734203427457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (316734203431523) 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 7 ways as a sum of consecutive naturals, for example, 6551380358 + ... + 6551428703.
It is an arithmetic number, because the mean of its divisors is an integer number (41352465399672).
Almost surely, 2316734203431553 is an apocalyptic number.
It is an amenable number.
316734203431553 is a deficient number, since it is larger than the sum of its proper divisors (14085519765823).
316734203431553 is a wasteful number, since it uses less digits than its factorization.
316734203431553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13102810135.
The product of its (nonzero) digits is 8164800, while the sum is 50.
The spelling of 316734203431553 in words is "three hundred sixteen trillion, seven hundred thirty-four billion, two hundred three million, four hundred thirty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •