Base | Representation |
---|---|
bin | 101001010010100001001… |
… | …0011100100101010001001 |
3 | 202002111120002001100001202 |
4 | 1102211002103210222021 |
5 | 1220433404120201121 |
6 | 20022541203353545 |
7 | 1123662643020113 |
oct | 122450223445211 |
9 | 22074502040052 |
10 | 5674764225161 |
11 | 1898721511a99 |
12 | 7779830828b5 |
13 | 3221881c6055 |
14 | 15893528c3b3 |
15 | 9c93108240b |
hex | 529424e4a89 |
5674764225161 has 32 divisors (see below), whose sum is σ = 5763647425536. Its totient is φ = 5586940800000.
The previous prime is 5674764225157. The next prime is 5674764225199. The reversal of 5674764225161 is 1615224674765.
It is a cyclic number.
It is not a de Polignac number, because 5674764225161 - 22 = 5674764225157 is a prime.
It is a super-2 number, since 2×56747642251612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5674764225097 and 5674764225106.
It is not an unprimeable number, because it can be changed into a prime (5674764225121) 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 31 ways as a sum of consecutive naturals, for example, 6621661445 + ... + 6621662301.
It is an arithmetic number, because the mean of its divisors is an integer number (180113982048).
Almost surely, 25674764225161 is an apocalyptic number.
It is an amenable number.
5674764225161 is a deficient number, since it is larger than the sum of its proper divisors (88883200375).
5674764225161 is a wasteful number, since it uses less digits than its factorization.
5674764225161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2033.
The product of its digits is 16934400, while the sum is 56.
The spelling of 5674764225161 in words is "five trillion, six hundred seventy-four billion, seven hundred sixty-four million, two hundred twenty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •