Base | Representation |
---|---|
bin | 100111000001001110110… |
… | …1100111010010110100111 |
3 | 200222200020022102120201002 |
4 | 1032002131230322112213 |
5 | 1200330420313403141 |
6 | 15223341545023515 |
7 | 1062306213141326 |
oct | 116023554722647 |
9 | 20880208376632 |
10 | 5362764981671 |
11 | 1788377030539 |
12 | 72740b184b9b |
13 | 2cb925439086 |
14 | 1477b86880bd |
15 | 94770251e9b |
hex | 4e09db3a5a7 |
5362764981671 has 4 divisors (see below), whose sum is σ = 5645015770200. Its totient is φ = 5080514193144.
The previous prime is 5362764981641. The next prime is 5362764981677. The reversal of 5362764981671 is 1761894672635.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5362764981671 - 210 = 5362764980647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5362764981598 and 5362764981607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5362764981677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141125394236 + ... + 141125394273.
It is an arithmetic number, because the mean of its divisors is an integer number (1411253942550).
Almost surely, 25362764981671 is an apocalyptic number.
5362764981671 is a deficient number, since it is larger than the sum of its proper divisors (282250788529).
5362764981671 is a wasteful number, since it uses less digits than its factorization.
5362764981671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282250788528.
The product of its digits is 91445760, while the sum is 65.
The spelling of 5362764981671 in words is "five trillion, three hundred sixty-two billion, seven hundred sixty-four million, nine hundred eighty-one thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •