Base | Representation |
---|---|
bin | 100011110001010100100111… |
… | …0101101001111110110111101 |
3 | 1112021001111002101100022002002 |
4 | 1013202221032231033312331 |
5 | 312220043341332422103 |
6 | 3033104315534112045 |
7 | 123163064635514216 |
oct | 10742511655176675 |
9 | 1467044071308062 |
10 | 314642034654653 |
11 | 91288a34952912 |
12 | 2b35789894b625 |
13 | 10674802757684 |
14 | 579aa81a3240d |
15 | 2659864a1c488 |
hex | 11e2a4eb4fdbd |
314642034654653 has 8 divisors (see below), whose sum is σ = 331211171239200. Its totient is φ = 298073801019888.
The previous prime is 314642034654643. The next prime is 314642034654707. The reversal of 314642034654653 is 356456430246413.
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 314642034654653 - 212 = 314642034650557 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 (314642034654643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225022118 + ... + 226416071.
It is an arithmetic number, because the mean of its divisors is an integer number (41401396404900).
Almost surely, 2314642034654653 is an apocalyptic number.
It is an amenable number.
314642034654653 is a deficient number, since it is larger than the sum of its proper divisors (16569136584547).
314642034654653 is a wasteful number, since it uses less digits than its factorization.
314642034654653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451474891.
The product of its (nonzero) digits is 74649600, while the sum is 56.
The spelling of 314642034654653 in words is "three hundred fourteen trillion, six hundred forty-two billion, thirty-four million, six hundred fifty-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •