Base | Representation |
---|---|
bin | 1010100100001010… |
… | …11010010001001001 |
3 | 112122022002102012022 |
4 | 11102011122101021 |
5 | 43104030223241 |
6 | 2334501054225 |
7 | 260363126123 |
oct | 52205322111 |
9 | 15568072168 |
10 | 5672117321 |
11 | 2450842772 |
12 | 11236b7375 |
13 | 6c5187950 |
14 | 3bb45c213 |
15 | 232e6c54b |
hex | 15215a449 |
5672117321 has 4 divisors (see below), whose sum is σ = 6108434052. Its totient is φ = 5235800592.
The previous prime is 5672117281. The next prime is 5672117323. The reversal of 5672117321 is 1237112765.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3607323721 + 2064793600 = 60061^2 + 45440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5672117321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5672117323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 218158346 + ... + 218158371.
It is an arithmetic number, because the mean of its divisors is an integer number (1527108513).
Almost surely, 25672117321 is an apocalyptic number.
It is an amenable number.
5672117321 is a deficient number, since it is larger than the sum of its proper divisors (436316731).
5672117321 is a wasteful number, since it uses less digits than its factorization.
5672117321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436316730.
The product of its digits is 17640, while the sum is 35.
The square root of 5672117321 is about 75313.4604237516. The cubic root of 5672117321 is about 1783.3985192426.
The spelling of 5672117321 in words is "five billion, six hundred seventy-two million, one hundred seventeen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •