Base | Representation |
---|---|
bin | 1110111111001101111… |
… | …11111111110101000101 |
3 | 1211020020121102002002122 |
4 | 13133212333333311011 |
5 | 31414133010110141 |
6 | 1032324344415325 |
7 | 52130413152611 |
oct | 7374677776505 |
9 | 1736217362078 |
10 | 514976644421 |
11 | 189444988088 |
12 | 83980777545 |
13 | 3973cbaa255 |
14 | 1acd42c8341 |
15 | d5e088264b |
hex | 77e6fffd45 |
514976644421 has 8 divisors (see below), whose sum is σ = 515945765184. Its totient is φ = 514007717760.
The previous prime is 514976644393. The next prime is 514976644459. The reversal of 514976644421 is 124446679415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-514976644421 is a prime.
It is a super-3 number, since 3×5149766444213 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514976644321) 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, 5956976 + ... + 6042806.
It is an arithmetic number, because the mean of its divisors is an integer number (64493220648).
Almost surely, 2514976644421 is an apocalyptic number.
It is an amenable number.
514976644421 is a deficient number, since it is larger than the sum of its proper divisors (969120763).
514976644421 is a wasteful number, since it uses less digits than its factorization.
514976644421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97051.
The product of its digits is 5806080, while the sum is 53.
The spelling of 514976644421 in words is "five hundred fourteen billion, nine hundred seventy-six million, six hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •