Base | Representation |
---|---|
bin | 10001111000110100100… |
… | …01000011100101000101 |
3 | 2011202102222211220201210 |
4 | 20330122101003211011 |
5 | 40032220434031203 |
6 | 1150204125042033 |
7 | 62255611214112 |
oct | 10743221034505 |
9 | 2152388756653 |
10 | 614621002053 |
11 | 217728594873 |
12 | 9b14b3b6319 |
13 | 45c5cb09506 |
14 | 21a6800d909 |
15 | 10ec376b803 |
hex | 8f1a443945 |
614621002053 has 8 divisors (see below), whose sum is σ = 847753106400. Its totient is φ = 395618116208.
The previous prime is 614621002031. The next prime is 614621002087. The reversal of 614621002053 is 350200126416.
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 614621002053 - 26 = 614621001989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 614621002053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (614621002753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3532304523 + ... + 3532304696.
It is an arithmetic number, because the mean of its divisors is an integer number (105969138300).
Almost surely, 2614621002053 is an apocalyptic number.
It is an amenable number.
614621002053 is a deficient number, since it is larger than the sum of its proper divisors (233132104347).
614621002053 is a wasteful number, since it uses less digits than its factorization.
614621002053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7064609251.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 614621002053 its reverse (350200126416), we get a palindrome (964821128469).
The spelling of 614621002053 in words is "six hundred fourteen billion, six hundred twenty-one million, two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •