Base | Representation |
---|---|
bin | 1011111110010001… |
… | …00101010101000000 |
3 | 121120222021100201222 |
4 | 11333020211111000 |
5 | 101131022030101 |
6 | 2541500414212 |
7 | 315201310361 |
oct | 57710452500 |
9 | 17528240658 |
10 | 6427923776 |
11 | 27a94392aa |
12 | 12b4847368 |
13 | 7b59362c1 |
14 | 44d9a1b68 |
15 | 2794b501b |
hex | 17f225540 |
6427923776 has 42 divisors (see below), whose sum is σ = 13202347230. Its totient is φ = 3101468160.
The previous prime is 6427923773. The next prime is 6427923797. The reversal of 6427923776 is 6773297246.
It can be written as a sum of positive squares in 3 ways, for example, as 746382400 + 5681541376 = 27320^2 + 75376^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6427923773) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3453086 + ... + 3454946.
Almost surely, 26427923776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6427923776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6601173615).
6427923776 is an abundant number, since it is smaller than the sum of its proper divisors (6774423454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6427923776 is an frugal number, since it uses more digits than its factorization.
6427923776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3763 (or 1892 counting only the distinct ones).
The product of its digits is 5334336, while the sum is 53.
The square root of 6427923776 is about 80174.3336486185. Note that the first 3 decimals coincide. The cubic root of 6427923776 is about 1859.3318384750.
The spelling of 6427923776 in words is "six billion, four hundred twenty-seven million, nine hundred twenty-three thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •